Base | Representation |
---|---|
bin | 1001000111010011100101… |
… | …0111010011011111001010 |
3 | 1022111000021011022220122011 |
4 | 2101310321113103133022 |
5 | 2303141224001041020 |
6 | 33151350043450134 |
7 | 2053000503004321 |
oct | 221647127233712 |
9 | 38430234286564 |
10 | 10021121112010 |
11 | 3213a2a688098 |
12 | 115a1b122694a |
13 | 578cabb96438 |
14 | 26904c28b0b8 |
15 | 125a1431535a |
hex | 91d395d37ca |
10021121112010 has 8 divisors (see below), whose sum is σ = 18038018001636. Its totient is φ = 4008448444800.
The previous prime is 10021121112001. The next prime is 10021121112017. The reversal of 10021121112010 is 1021112112001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 9217593530401 + 803527581609 = 3036049^2 + 896397^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (10021121112017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501056055591 + ... + 501056055610.
Almost surely, 210021121112010 is an apocalyptic number.
10021121112010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10021121112010 is a deficient number, since it is larger than the sum of its proper divisors (8016896889626).
10021121112010 is a wasteful number, since it uses less digits than its factorization.
10021121112010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1002112111208.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10021121112010 its reverse (1021112112001), we get a palindrome (11042233224011).
Subtracting from 10021121112010 its reverse (1021112112001), we obtain a palindrome (9000009000009).
The spelling of 10021121112010 in words is "ten trillion, twenty-one billion, one hundred twenty-one million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •