Base | Representation |
---|---|
bin | 11101101001111000000001… |
… | …100011101001011000111010 |
3 | 122002210010101221111020102020 |
4 | 131221320001203221120322 |
5 | 114043304203234011442 |
6 | 1141214325350015310 |
7 | 36320415015346335 |
oct | 3551700143513072 |
9 | 562703357436366 |
10 | 130421003032122 |
11 | 38613267163510 |
12 | 1276456a047536 |
13 | 57a085632a48a |
14 | 242c5a594361c |
15 | 1012839cdc9ec |
hex | 769e018e963a |
130421003032122 has 32 divisors (see below), whose sum is σ = 284648612197824. Its totient is φ = 39508502668800.
The previous prime is 130421003032097. The next prime is 130421003032129. The reversal of 130421003032122 is 221230300124031.
It is a junction number, because it is equal to n+sod(n) for n = 130421003032092 and 130421003032101.
It is not an unprimeable number, because it can be changed into a prime (130421003032129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 325133079 + ... + 325533962.
It is an arithmetic number, because the mean of its divisors is an integer number (8895269131182).
Almost surely, 2130421003032122 is an apocalyptic number.
130421003032122 is an abundant number, since it is smaller than the sum of its proper divisors (154227609165702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130421003032122 is a wasteful number, since it uses less digits than its factorization.
130421003032122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 650670094.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 130421003032122 its reverse (221230300124031), we get a palindrome (351651303156153).
The spelling of 130421003032122 in words is "one hundred thirty trillion, four hundred twenty-one billion, three million, thirty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •