Base | Representation |
---|---|
bin | 11101100011110000111110… |
… | …100101000001111110001001 |
3 | 122001021222121120111200211011 |
4 | 131203300332211001332021 |
5 | 114014414243210310441 |
6 | 1140253405015403521 |
7 | 36245161641505213 |
oct | 3543607645017611 |
9 | 561258546450734 |
10 | 130001120010121 |
11 | 3847119013a428 |
12 | 126b71080835a1 |
13 | 577008c620a79 |
14 | 2416132c295b3 |
15 | 1006962a83581 |
hex | 763c3e941f89 |
130001120010121 has 32 divisors (see below), whose sum is σ = 137709501776000. Its totient is φ = 122382484305408.
The previous prime is 130001120010119. The next prime is 130001120010133. The reversal of 130001120010121 is 121010021100031.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 130001120010121 - 21 = 130001120010119 is a prime.
It is a super-2 number, since 2×1300011200101212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130001120010101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2472465010 + ... + 2472517588.
It is an arithmetic number, because the mean of its divisors is an integer number (4303421930500).
Almost surely, 2130001120010121 is an apocalyptic number.
It is an amenable number.
130001120010121 is a deficient number, since it is larger than the sum of its proper divisors (7708381765879).
130001120010121 is a wasteful number, since it uses less digits than its factorization.
130001120010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54233.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 130001120010121 its reverse (121010021100031), we get a palindrome (251011141110152).
The spelling of 130001120010121 in words is "one hundred thirty trillion, one billion, one hundred twenty million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •