Base | Representation |
---|---|
bin | 10010110110110001… |
… | …00110011010000100 |
3 | 222010111102021022202 |
4 | 21123120212122010 |
5 | 131213004010040 |
6 | 4352301214032 |
7 | 505601005202 |
oct | 113330463204 |
9 | 28114367282 |
10 | 10123110020 |
11 | 4325260431 |
12 | 1b66261318 |
13 | c54362b3a |
14 | 6c064c072 |
15 | 3e3aca015 |
hex | 25b626684 |
10123110020 has 48 divisors (see below), whose sum is σ = 22817431728. Its totient is φ = 3758837760.
The previous prime is 10123110013. The next prime is 10123110029. The reversal of 10123110020 is 2001132101.
It can be written as a sum of positive squares in 8 ways, for example, as 10394176 + 10112715844 = 3224^2 + 100562^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10123109983 and 10123110010.
It is not an unprimeable number, because it can be changed into a prime (10123110029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179111 + ... + 228750.
It is an arithmetic number, because the mean of its divisors is an integer number (475363161).
Almost surely, 210123110020 is an apocalyptic number.
10123110020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10123110020 is an abundant number, since it is smaller than the sum of its proper divisors (12694321708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10123110020 is a wasteful number, since it uses less digits than its factorization.
10123110020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407960 (or 407958 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10123110020 its reverse (2001132101), we get a palindrome (12124242121).
The spelling of 10123110020 in words is "ten billion, one hundred twenty-three million, one hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •