Base | Representation |
---|---|
bin | 11110010010101000110101… |
… | …111010100011100111101110 |
3 | 122110200220210012000200222111 |
4 | 132102220311322203213232 |
5 | 114430203031213130110 |
6 | 1151201233413234234 |
7 | 40026662211666664 |
oct | 3622506572434756 |
9 | 573626705020874 |
10 | 133222200130030 |
11 | 394a3243972400 |
12 | 12b3743133297a |
13 | 5944a5185776b |
14 | 24c7dbb730c34 |
15 | 1060636222e8a |
hex | 792a35ea39ee |
133222200130030 has 48 divisors (see below), whose sum is σ = 263583363410640. Its totient is φ = 48444144376320.
The previous prime is 133222200130021. The next prime is 133222200130051. The reversal of 133222200130030 is 30031002222331.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 133222200129983 and 133222200130010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 394892761 + ... + 395229979.
It is an arithmetic number, because the mean of its divisors is an integer number (5491320071055).
Almost surely, 2133222200130030 is an apocalyptic number.
133222200130030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133222200130030 is a deficient number, since it is larger than the sum of its proper divisors (130361163280610).
133222200130030 is a wasteful number, since it uses less digits than its factorization.
133222200130030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663745 (or 663734 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 133222200130030 its reverse (30031002222331), we get a palindrome (163253202352361).
The spelling of 133222200130030 in words is "one hundred thirty-three trillion, two hundred twenty-two billion, two hundred million, one hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •