Base | Representation |
---|---|
bin | 1001100011010111100001… |
… | …1010101100011001011000 |
3 | 1101012002122010121020112202 |
4 | 2120311320122230121120 |
5 | 2334041041104132412 |
6 | 34201035511225332 |
7 | 2132555316005642 |
oct | 230657032543130 |
9 | 41162563536482 |
10 | 10503215302232 |
11 | 338a430246694 |
12 | 1217715678248 |
13 | 5b25ab471ba3 |
14 | 2845033a1892 |
15 | 13332ce983c2 |
hex | 98d786ac658 |
10503215302232 has 64 divisors (see below), whose sum is σ = 20679451480800. Its totient is φ = 4994170030080.
The previous prime is 10503215302219. The next prime is 10503215302241. The reversal of 10503215302232 is 23220351230501.
It is a super-2 number, since 2×105032153022322 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 10503215302195 and 10503215302204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 127746128 + ... + 127828320.
Almost surely, 210503215302232 is an apocalyptic number.
It is an amenable number.
10503215302232 is a deficient number, since it is larger than the sum of its proper divisors (10176236178568).
10503215302232 is a wasteful number, since it uses less digits than its factorization.
10503215302232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90516 (or 90512 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 10503215302232 its reverse (23220351230501), we get a palindrome (33723566532733).
The spelling of 10503215302232 in words is "ten trillion, five hundred three billion, two hundred fifteen million, three hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •