Base | Representation |
---|---|
bin | 11101000110110111101… |
… | …11001110101011010101 |
3 | 10112121111011021222211202 |
4 | 32203123313032223111 |
5 | 112341222000213023 |
6 | 2043241014042245 |
7 | 132153635044136 |
oct | 16433367165325 |
9 | 3477434258752 |
10 | 1000121101013 |
11 | 356170319981 |
12 | 1419b6649385 |
13 | 734073b9948 |
14 | 3659856bc8d |
15 | 1b0371d8128 |
hex | e8dbdcead5 |
1000121101013 has 8 divisors (see below), whose sum is σ = 1044160668288. Its totient is φ = 956127870544.
The previous prime is 1000121101003. The next prime is 1000121101043. The reversal of 1000121101013 is 3101011210001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000121101013 - 24 = 1000121100997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000121100985 and 1000121101003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000121101003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11540081 + ... + 11626422.
It is an arithmetic number, because the mean of its divisors is an integer number (130520083536).
Almost surely, 21000121101013 is an apocalyptic number.
It is an amenable number.
1000121101013 is a deficient number, since it is larger than the sum of its proper divisors (44039567275).
1000121101013 is a wasteful number, since it uses less digits than its factorization.
1000121101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23168403.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1000121101013 its reverse (3101011210001), we get a palindrome (4101132311014).
The spelling of 1000121101013 in words is "one trillion, one hundred twenty-one million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •