Base | Representation |
---|---|
bin | 1110100111011111000011… |
… | …11101100111011101110010 |
3 | 11012210211210010011120210220 |
4 | 13103233201331213131302 |
5 | 13203112412003131002 |
6 | 152210145453233510 |
7 | 6525154165036605 |
oct | 723574175473562 |
9 | 135724703146726 |
10 | 32143031302002 |
11 | a272868226045 |
12 | 3731650192896 |
13 | 14c20c858961a |
14 | 7d1a33c9c33c |
15 | 3ab1a9ba17bc |
hex | 1d3be1f67772 |
32143031302002 has 8 divisors (see below), whose sum is σ = 64286062604016. Its totient is φ = 10714343767332.
The previous prime is 32143031301929. The next prime is 32143031302021. The reversal of 32143031302002 is 20020313034123.
It is a sphenic number, since it is the product of 3 distinct primes.
32143031302002 is an admirable number.
It is a super-2 number, since 2×321430313020022 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2678585941828 + ... + 2678585941839.
It is an arithmetic number, because the mean of its divisors is an integer number (8035757825502).
Almost surely, 232143031302002 is an apocalyptic number.
32143031302002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32143031302002 is a wasteful number, since it uses less digits than its factorization.
32143031302002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5357171883672.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 32143031302002 its reverse (20020313034123), we get a palindrome (52163344336125).
The spelling of 32143031302002 in words is "thirty-two trillion, one hundred forty-three billion, thirty-one million, three hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •