Base | Representation |
---|---|
bin | 11001000010101000101101… |
… | …110100110001100000001010 |
3 | 112102221112202202101001121210 |
4 | 121002220231310301200022 |
5 | 103413401442433304002 |
6 | 1030122031153113550 |
7 | 32124540364002363 |
oct | 3102505564614012 |
9 | 472845682331553 |
10 | 110132320213002 |
11 | 3210094468672a |
12 | 1042846b2588b6 |
13 | 495b582a77499 |
14 | 1d2a60b61ab6a |
15 | caebdb0db96c |
hex | 642a2dd3180a |
110132320213002 has 64 divisors (see below), whose sum is σ = 233525129822208. Its totient is φ = 34564890888000.
The previous prime is 110132320213001. The next prime is 110132320213007. The reversal of 110132320213002 is 200312023231011.
It is a self number, because there is not a number n which added to its sum of digits gives 110132320213002.
It is not an unprimeable number, because it can be changed into a prime (110132320213001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 165462127 + ... + 166126397.
It is an arithmetic number, because the mean of its divisors is an integer number (3648830153472).
Almost surely, 2110132320213002 is an apocalyptic number.
110132320213002 is an abundant number, since it is smaller than the sum of its proper divisors (123392809609206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110132320213002 is a wasteful number, since it uses less digits than its factorization.
110132320213002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688435.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 110132320213002 its reverse (200312023231011), we get a palindrome (310444343444013).
The spelling of 110132320213002 in words is "one hundred ten trillion, one hundred thirty-two billion, three hundred twenty million, two hundred thirteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •