Base | Representation |
---|---|
bin | 11110000010010100110110… |
… | …011010010110011100100101 |
3 | 122022201202100021220112102110 |
4 | 132002110312122112130211 |
5 | 114303321300313003141 |
6 | 1144542244045431233 |
7 | 36552666300053502 |
oct | 3602246632263445 |
9 | 568652307815373 |
10 | 132101222000421 |
11 | 391008a4a47113 |
12 | 12996127b6b519 |
13 | 589312685425b |
14 | 2489a3a0c84a9 |
15 | 10413c8be4e16 |
hex | 782536696725 |
132101222000421 has 16 divisors (see below), whose sum is σ = 188547685286400. Its totient is φ = 82018243095408.
The previous prime is 132101222000413. The next prime is 132101222000437. The reversal of 132101222000421 is 124000222101231.
It is a happy number.
It is not a de Polignac number, because 132101222000421 - 23 = 132101222000413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132101222000021) 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, 19640380521 + ... + 19640387246.
It is an arithmetic number, because the mean of its divisors is an integer number (11784230330400).
Almost surely, 2132101222000421 is an apocalyptic number.
It is an amenable number.
132101222000421 is a deficient number, since it is larger than the sum of its proper divisors (56446463285979).
132101222000421 is a wasteful number, since it uses less digits than its factorization.
132101222000421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39280767848.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 132101222000421 its reverse (124000222101231), we get a palindrome (256101444101652).
The spelling of 132101222000421 in words is "one hundred thirty-two trillion, one hundred one billion, two hundred twenty-two million, four hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •