Base | Representation |
---|---|
bin | 11110000000111111000… |
… | …01111001100011001001 |
3 | 10122121000112122202011200 |
4 | 33000133201321203021 |
5 | 113344121202144314 |
6 | 2105440555014413 |
7 | 134340045655245 |
oct | 17003741714311 |
9 | 3577015582150 |
10 | 1031321131209 |
11 | 36842098a3a6 |
12 | 147a6343a409 |
13 | 7633a286b85 |
14 | 37cb8113425 |
15 | 1bc61356709 |
hex | f01f8798c9 |
1031321131209 has 24 divisors (see below), whose sum is σ = 1569845714112. Its totient is φ = 651142615200.
The previous prime is 1031321131199. The next prime is 1031321131229. The reversal of 1031321131209 is 9021311231301.
1031321131209 is a `hidden beast` number, since 1 + 0 + 3 + 1 + 321 + 131 + 209 = 666.
1031321131209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1031321131209 - 27 = 1031321131081 is a prime.
It is a super-2 number, since 2×10313211312092 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1031321131229) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24643587 + ... + 24685400.
It is an arithmetic number, because the mean of its divisors is an integer number (65410238088).
Almost surely, 21031321131209 is an apocalyptic number.
It is an amenable number.
1031321131209 is a deficient number, since it is larger than the sum of its proper divisors (538524582903).
1031321131209 is a wasteful number, since it uses less digits than its factorization.
1031321131209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49329117 (or 49329114 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The spelling of 1031321131209 in words is "one trillion, thirty-one billion, three hundred twenty-one million, one hundred thirty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •