Base | Representation |
---|---|
bin | 11101110011010111… |
… | …001010100010101001 |
3 | 10001121011001210001022 |
4 | 131303113022202221 |
5 | 1011014024122101 |
6 | 22411203502225 |
7 | 2211665260646 |
oct | 356327124251 |
9 | 101534053038 |
10 | 32000223401 |
11 | 12631323523 |
12 | 6250987975 |
13 | 302c8ba043 |
14 | 1797d60dcd |
15 | c74532a1b |
hex | 7735ca8a9 |
32000223401 has 32 divisors (see below), whose sum is σ = 34005319680. Its totient is φ = 30073680000.
The previous prime is 32000223349. The next prime is 32000223419. The reversal of 32000223401 is 10432200023.
It is a cyclic number.
It is not a de Polignac number, because 32000223401 - 210 = 32000222377 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 32000223401.
It is not an unprimeable number, because it can be changed into a prime (32000223001) 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, 42609776 + ... + 42610526.
It is an arithmetic number, because the mean of its divisors is an integer number (1062666240).
Almost surely, 232000223401 is an apocalyptic number.
32000223401 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
32000223401 is a deficient number, since it is larger than the sum of its proper divisors (2005096279).
32000223401 is a wasteful number, since it uses less digits than its factorization.
32000223401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 32000223401 its reverse (10432200023), we get a palindrome (42432423424).
The spelling of 32000223401 in words is "thirty-two billion, two hundred twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •