Base | Representation |
---|---|
bin | 11110010001010010111110… |
… | …011110101001110000100101 |
3 | 122110101002210202000002110111 |
4 | 132101102332132221300211 |
5 | 114422200221003410341 |
6 | 1151051024551453021 |
7 | 40020216361636423 |
oct | 3621227636516045 |
9 | 573332722002414 |
10 | 133130002013221 |
11 | 39468131498654 |
12 | 12b215a0387171 |
13 | 593914a513065 |
14 | 24c3752926113 |
15 | 105d03bdec681 |
hex | 7914be7a9c25 |
133130002013221 has 16 divisors (see below), whose sum is σ = 144354830400000. Its totient is φ = 122286912104448.
The previous prime is 133130002013219. The next prime is 133130002013227. The reversal of 133130002013221 is 122310200031331.
It is a cyclic number.
It is not a de Polignac number, because 133130002013221 - 21 = 133130002013219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133130002013192 and 133130002013201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133130002013227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71993461 + ... + 73819498.
It is an arithmetic number, because the mean of its divisors is an integer number (9022176900000).
Almost surely, 2133130002013221 is an apocalyptic number.
It is an amenable number.
133130002013221 is a deficient number, since it is larger than the sum of its proper divisors (11224828386779).
133130002013221 is a wasteful number, since it uses less digits than its factorization.
133130002013221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145814268.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 133130002013221 its reverse (122310200031331), we get a palindrome (255440202044552).
The spelling of 133130002013221 in words is "one hundred thirty-three trillion, one hundred thirty billion, two million, thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •