Base | Representation |
---|---|
bin | 11110010001100101101100… |
… | …101111011010010100101010 |
3 | 122110110000200210021121021002 |
4 | 132101211230233122110222 |
5 | 114423012404002324320 |
6 | 1151104151455315002 |
7 | 40021530511564634 |
oct | 3621455457322452 |
9 | 573400623247232 |
10 | 133150105511210 |
11 | 394757083881a7 |
12 | 12b25470b1ba62 |
13 | 593b0024876b8 |
14 | 24c46dc86da54 |
15 | 105d816cae675 |
hex | 79196cbda52a |
133150105511210 has 64 divisors (see below), whose sum is σ = 251287692733440. Its totient is φ = 50733536578560.
The previous prime is 133150105511191. The next prime is 133150105511219. The reversal of 133150105511210 is 12115501051331.
It is a happy number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (133150105511219) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24467336 + ... + 29410044.
It is an arithmetic number, because the mean of its divisors is an integer number (3926370198960).
Almost surely, 2133150105511210 is an apocalyptic number.
133150105511210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133150105511210 is a deficient number, since it is larger than the sum of its proper divisors (118137587222230).
133150105511210 is a wasteful number, since it uses less digits than its factorization.
133150105511210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4944111.
The product of its (nonzero) digits is 2250, while the sum is 29.
Adding to 133150105511210 its reverse (12115501051331), we get a palindrome (145265606562541).
The spelling of 133150105511210 in words is "one hundred thirty-three trillion, one hundred fifty billion, one hundred five million, five hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •