Base | Representation |
---|---|
bin | 101010000111011… |
… | …0010010011011111 |
3 | 10122111010002010000 |
4 | 1110032302103133 |
5 | 10343232142312 |
6 | 352120545343 |
7 | 50006452302 |
oct | 12416622337 |
9 | 3574102100 |
10 | 1413162207 |
11 | 665769756 |
12 | 335322253 |
13 | 196a09772 |
14 | d597ab39 |
15 | 840e4adc |
hex | 543b24df |
1413162207 has 40 divisors (see below), whose sum is σ = 2165245632. Its totient is φ = 918086400.
The previous prime is 1413162197. The next prime is 1413162209. The reversal of 1413162207 is 7022613141.
1413162207 is a `hidden beast` number, since 1 + 4 + 1 + 31 + 622 + 0 + 7 = 666.
It is not a de Polignac number, because 1413162207 - 214 = 1413145823 is a prime.
It is a super-2 number, since 2×14131622072 = 3994054846586221698, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1413162209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1069107 + ... + 1070427.
Almost surely, 21413162207 is an apocalyptic number.
1413162207 is a deficient number, since it is larger than the sum of its proper divisors (752083425).
1413162207 is a wasteful number, since it uses less digits than its factorization.
1413162207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1661 (or 1652 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 1413162207 is about 37592.0497844957. The cubic root of 1413162207 is about 1122.1838255816.
Adding to 1413162207 its reverse (7022613141), we get a palindrome (8435775348).
The spelling of 1413162207 in words is "one billion, four hundred thirteen million, one hundred sixty-two thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •