Base | Representation |
---|---|
bin | 1001011001010010101110… |
… | …1111111001001011001001 |
3 | 1100120112212112200020021211 |
4 | 2112110223233321023021 |
5 | 2323222101330301441 |
6 | 33545332451333121 |
7 | 2114220154650451 |
oct | 226245357711311 |
9 | 40515775606254 |
10 | 10330130322121 |
11 | 3322a90296285 |
12 | 11aa06b8b11a1 |
13 | 59c18634b4ac |
14 | 279da3b20d61 |
15 | 12da9c8bea81 |
hex | 9652bbf92c9 |
10330130322121 has 8 divisors (see below), whose sum is σ = 10663414182144. Its totient is φ = 9996849827760.
The previous prime is 10330130322101. The next prime is 10330130322131. The reversal of 10330130322121 is 12122303103301.
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 10330130322121 - 27 = 10330130321993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10330130322092 and 10330130322101.
It is not an unprimeable number, because it can be changed into a prime (10330130322101) 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, 6380070 + ... + 7833616.
It is an arithmetic number, because the mean of its divisors is an integer number (1332926772768).
Almost surely, 210330130322121 is an apocalyptic number.
It is an amenable number.
10330130322121 is a deficient number, since it is larger than the sum of its proper divisors (333283860023).
10330130322121 is a wasteful number, since it uses less digits than its factorization.
10330130322121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1682831.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10330130322121 its reverse (12122303103301), we get a palindrome (22452433425422).
The spelling of 10330130322121 in words is "ten trillion, three hundred thirty billion, one hundred thirty million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •