Base | Representation |
---|---|
bin | 1001001100000100111111… |
… | …0011101001111001101110 |
3 | 1022202211212112212121020021 |
4 | 2103001033303221321232 |
5 | 2311012123104134410 |
6 | 33253145003112354 |
7 | 2061632200146421 |
oct | 223011763517156 |
9 | 38684775777207 |
10 | 10103102021230 |
11 | 3245779781629 |
12 | 11720705126ba |
13 | 58394551cc8a |
14 | 26cdc81519b8 |
15 | 127c11674eda |
hex | 9304fce9e6e |
10103102021230 has 8 divisors (see below), whose sum is σ = 18185583638232. Its totient is φ = 4041240808488.
The previous prime is 10103102021197. The next prime is 10103102021263. The reversal of 10103102021230 is 3212020130101.
It is an interprime number because it is at equal distance from previous prime (10103102021197) and next prime (10103102021263).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101031020212302 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505155101052 + ... + 505155101071.
It is an arithmetic number, because the mean of its divisors is an integer number (2273197954779).
Almost surely, 210103102021230 is an apocalyptic number.
10103102021230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10103102021230 is a deficient number, since it is larger than the sum of its proper divisors (8082481617002).
10103102021230 is a wasteful number, since it uses less digits than its factorization.
10103102021230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1010310202130.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10103102021230 its reverse (3212020130101), we get a palindrome (13315122151331).
The spelling of 10103102021230 in words is "ten trillion, one hundred three billion, one hundred two million, twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •