Base | Representation |
---|---|
bin | 1001000111010011001000… |
… | …1001101110011110001010 |
3 | 1022110222221201122110211200 |
4 | 2101310302021232132022 |
5 | 2303141002012041020 |
6 | 33151330042205030 |
7 | 2052664503346536 |
oct | 221646211563612 |
9 | 38428851573750 |
10 | 10021000112010 |
11 | 3213978352a98 |
12 | 115a1787b3776 |
13 | 578c8caac2c4 |
14 | 26903a190bc6 |
15 | 125a088b3590 |
hex | 91d3226e78a |
10021000112010 has 48 divisors (see below), whose sum is σ = 26143523910504. Its totient is φ = 2663146325376.
The previous prime is 10021000111961. The next prime is 10021000112063. The reversal of 10021000112010 is 1021100012001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 9879096468609 + 141903643401 = 3143103^2 + 376701^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10021000111983 and 10021000112001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 189981217 + ... + 190033956.
Almost surely, 210021000112010 is an apocalyptic number.
10021000112010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10021000112010 is an abundant number, since it is smaller than the sum of its proper divisors (16122523798494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021000112010 is a wasteful number, since it uses less digits than its factorization.
10021000112010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380015479 (or 380015476 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10021000112010 its reverse (1021100012001), we get a palindrome (11042100124011).
The spelling of 10021000112010 in words is "ten trillion, twenty-one billion, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •