Base | Representation |
---|---|
bin | 1001101001000000100111… |
… | …1001011011001111000000 |
3 | 1101112100211100120002202222 |
4 | 2122100021321123033000 |
5 | 2342133044201211412 |
6 | 34313350050230212 |
7 | 2142556324463225 |
oct | 232201171331700 |
9 | 41470740502688 |
10 | 10600145335232 |
11 | 3417550773082 |
12 | 1232467285368 |
13 | 5bb787c405bb |
14 | 28909a80594c |
15 | 135b0291d072 |
hex | 9a409e5b3c0 |
10600145335232 has 28 divisors (see below), whose sum is σ = 22271996543040. Its totient is φ = 4988303686656.
The previous prime is 10600145335223. The next prime is 10600145335259. The reversal of 10600145335232 is 23253354100601.
It is a happy number.
It is a super-2 number, since 2×106001453352322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10600145335192 and 10600145335201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4871389232 + ... + 4871391407.
Almost surely, 210600145335232 is an apocalyptic number.
It is an amenable number.
10600145335232 is an abundant number, since it is smaller than the sum of its proper divisors (11671851207808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10600145335232 is an equidigital number, since it uses as much as digits as its factorization.
10600145335232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9742780668 (or 9742780658 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 10600145335232 its reverse (23253354100601), we get a palindrome (33853499435833).
The spelling of 10600145335232 in words is "ten trillion, six hundred billion, one hundred forty-five million, three hundred thirty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •