Base | Representation |
---|---|
bin | 1001010111100010100010… |
… | …0111110110101100111001 |
3 | 1100110200010121211110000121 |
4 | 2111320220213312230321 |
5 | 2322223411324041441 |
6 | 33523432151133241 |
7 | 2112102632620465 |
oct | 225705047665471 |
9 | 40420117743017 |
10 | 10300013112121 |
11 | 3311235976687 |
12 | 11a4265674221 |
13 | 5993968c8385 |
14 | 278747cc54a5 |
15 | 12cdd8841dd1 |
hex | 95e289f6b39 |
10300013112121 has 8 divisors (see below), whose sum is σ = 10383514336800. Its totient is φ = 10216585753920.
The previous prime is 10300013112101. The next prime is 10300013112133. The reversal of 10300013112121 is 12121131000301.
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 10300013112121 - 213 = 10300013103929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10300013112095 and 10300013112104.
It is not an unprimeable number, because it can be changed into a prime (10300013112101) 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, 18186591 + ... + 18744388.
It is an arithmetic number, because the mean of its divisors is an integer number (1297939292100).
Almost surely, 210300013112121 is an apocalyptic number.
It is an amenable number.
10300013112121 is a deficient number, since it is larger than the sum of its proper divisors (83501224679).
10300013112121 is a wasteful number, since it uses less digits than its factorization.
10300013112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36933239.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10300013112121 its reverse (12121131000301), we get a palindrome (22421144112422).
The spelling of 10300013112121 in words is "ten trillion, three hundred billion, thirteen million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •