Base | Representation |
---|---|
bin | 1110101101001110001111… |
… | …10100000111100011101011 |
3 | 11020111200121102122220100212 |
4 | 13112213013310013203223 |
5 | 13214330122220200021 |
6 | 152440510453051335 |
7 | 6545333224501022 |
oct | 726470764074353 |
9 | 136450542586325 |
10 | 32340161100011 |
11 | a33942691aa86 |
12 | 37638a6626b4b |
13 | 150788306bb0b |
14 | 7db3b4ac38b9 |
15 | 3b139617085b |
hex | 1d69c7d078eb |
32340161100011 has 8 divisors (see below), whose sum is σ = 32952913009200. Its totient is φ = 31729562977120.
The previous prime is 32340161099929. The next prime is 32340161100041. The reversal of 32340161100011 is 11000116104323.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32340161100011 - 230 = 32339087358187 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 32340161100011.
It is not an unprimeable number, because it can be changed into a prime (32340161100041) 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, 538416260 + ... + 538476321.
It is an arithmetic number, because the mean of its divisors is an integer number (4119114126150).
Almost surely, 232340161100011 is an apocalyptic number.
32340161100011 is a deficient number, since it is larger than the sum of its proper divisors (612751909189).
32340161100011 is a wasteful number, since it uses less digits than its factorization.
32340161100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1076893149.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 32340161100011 its reverse (11000116104323), we get a palindrome (43340277204334).
The spelling of 32340161100011 in words is "thirty-two trillion, three hundred forty billion, one hundred sixty-one million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •