Base | Representation |
---|---|
bin | 1001100100011011101010… |
… | …0101001110110100010111 |
3 | 1101020211211210022211211201 |
4 | 2121012322211032310113 |
5 | 2334341020314330403 |
6 | 34213302432013331 |
7 | 2134103464560550 |
oct | 231067245166427 |
9 | 41224753284751 |
10 | 10521505230103 |
11 | 339716645315a |
12 | 121b17a991247 |
13 | 5b423478490a |
14 | 28535a4dd327 |
15 | 133a4da2121d |
hex | 991ba94ed17 |
10521505230103 has 64 divisors (see below), whose sum is σ = 13408167499776. Its totient is φ = 8049148416000.
The previous prime is 10521505230077. The next prime is 10521505230127. The reversal of 10521505230103 is 30103250512501.
It is a cyclic number.
It is not a de Polignac number, because 10521505230103 - 29 = 10521505229591 is a prime.
It is a super-2 number, since 2×105215052301032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10521505230143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 186090948 + ... + 186147478.
It is an arithmetic number, because the mean of its divisors is an integer number (209502617184).
Almost surely, 210521505230103 is an apocalyptic number.
10521505230103 is a deficient number, since it is larger than the sum of its proper divisors (2886662269673).
10521505230103 is a wasteful number, since it uses less digits than its factorization.
10521505230103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57664.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 10521505230103 its reverse (30103250512501), we get a palindrome (40624755742604).
The spelling of 10521505230103 in words is "ten trillion, five hundred twenty-one billion, five hundred five million, two hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •