Base | Representation |
---|---|
bin | 1001000110000101010010… |
… | …0010001101111000110010 |
3 | 1022102000000022101112112000 |
4 | 2101201110202031320302 |
5 | 2302320202120333020 |
6 | 33133552233514430 |
7 | 2051324565352221 |
oct | 221412442157062 |
9 | 38360008345460 |
10 | 10000102121010 |
11 | 3206023a44051 |
12 | 1156105b72a16 |
13 | 57700c362561 |
14 | 268016912cb8 |
15 | 1251d3db6090 |
hex | 9185488de32 |
10000102121010 has 32 divisors (see below), whose sum is σ = 26666938990080. Its totient is φ = 2666693898864.
The previous prime is 10000102120969. The next prime is 10000102121033. The reversal of 10000102121010 is 1012120100001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10000102120983 and 10000102121001.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18518707362 + ... + 18518707901.
It is an arithmetic number, because the mean of its divisors is an integer number (833341843440).
Almost surely, 210000102121010 is an apocalyptic number.
10000102121010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10000102121010 is an abundant number, since it is smaller than the sum of its proper divisors (16666836869070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000102121010 is a wasteful number, since it uses less digits than its factorization.
10000102121010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37037415279 (or 37037415273 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10000102121010 its reverse (1012120100001), we get a palindrome (11012222221011).
The spelling of 10000102121010 in words is "ten trillion, one hundred two million, one hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •