Base | Representation |
---|---|
bin | 11110010010100000100100… |
… | …110000010100111010110110 |
3 | 122110200001212110211021011222 |
4 | 132102200210300110322312 |
5 | 114430031341002113420 |
6 | 1151153204434430342 |
7 | 40026226211461562 |
oct | 3622404460247266 |
9 | 573601773737158 |
10 | 133213322301110 |
11 | 3949a4a8636107 |
12 | 12b357741323b2 |
13 | 5943c684b165c |
14 | 24c77b863c6a2 |
15 | 10602b6b2a225 |
hex | 792824c14eb6 |
133213322301110 has 16 divisors (see below), whose sum is σ = 242819220398400. Its totient is φ = 52610831085696.
The previous prime is 133213322301091. The next prime is 133213322301119. The reversal of 133213322301110 is 11103223312331.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 133213322301110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133213322301119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84312228515 + ... + 84312230094.
It is an arithmetic number, because the mean of its divisors is an integer number (15176201274900).
Almost surely, 2133213322301110 is an apocalyptic number.
133213322301110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133213322301110 is a deficient number, since it is larger than the sum of its proper divisors (109605898097290).
133213322301110 is a wasteful number, since it uses less digits than its factorization.
133213322301110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168624458695.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 133213322301110 its reverse (11103223312331), we get a palindrome (144316545613441).
The spelling of 133213322301110 in words is "one hundred thirty-three trillion, two hundred thirteen billion, three hundred twenty-two million, three hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •