Base | Representation |
---|---|
bin | 10000000010101000100… |
… | …110111010010100101111 |
3 | 10220101022222221102120012 |
4 | 100002220212322110233 |
5 | 121030043120303211 |
6 | 2202224100243435 |
7 | 142433010542264 |
oct | 20025046722457 |
9 | 3811288842505 |
10 | 1102340400431 |
11 | 395555466526 |
12 | 1597836a057b |
13 | 7cc479272ba |
14 | 3b4d425126b |
15 | 1da1b1a2d8b |
hex | 100a89ba52f |
1102340400431 has 32 divisors (see below), whose sum is σ = 1190927370240. Its totient is φ = 1017844793856.
The previous prime is 1102340400323. The next prime is 1102340400433. The reversal of 1102340400431 is 1340040432011.
It is not a de Polignac number, because 1102340400431 - 218 = 1102340138287 is a prime.
It is a super-2 number, since 2×11023404004312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 1102340400397 and 1102340400406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102340400433) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26466935 + ... + 26508551.
It is an arithmetic number, because the mean of its divisors is an integer number (37216480320).
Almost surely, 21102340400431 is an apocalyptic number.
1102340400431 is a deficient number, since it is larger than the sum of its proper divisors (88586969809).
1102340400431 is a wasteful number, since it uses less digits than its factorization.
1102340400431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42023.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1102340400431 its reverse (1340040432011), we get a palindrome (2442380832442).
The spelling of 1102340400431 in words is "one trillion, one hundred two billion, three hundred forty million, four hundred thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •