Base | Representation |
---|---|
bin | 1110100110010001010110… |
… | …10011111100101110000010 |
3 | 11012122212002122100122011220 |
4 | 13103020223103330232002 |
5 | 13201421441412020114 |
6 | 152135050024415510 |
7 | 6522146304510201 |
oct | 723105323745602 |
9 | 135585078318156 |
10 | 32101312220034 |
11 | a2570a9961302 |
12 | 3725548617596 |
13 | 14bb1aa3091c5 |
14 | 7cd9d727d238 |
15 | 3aa0672e70a9 |
hex | 1d322b4fcb82 |
32101312220034 has 16 divisors (see below), whose sum is σ = 66994042894272. Its totient is φ = 10235200997648.
The previous prime is 32101312219997. The next prime is 32101312220053. The reversal of 32101312220034 is 43002221310123.
It is a super-2 number, since 2×321013122200342 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 32101312219986 and 32101312220013.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116309102109 + ... + 116309102384.
It is an arithmetic number, because the mean of its divisors is an integer number (4187127680892).
Almost surely, 232101312220034 is an apocalyptic number.
32101312220034 is an abundant number, since it is smaller than the sum of its proper divisors (34892730674238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32101312220034 is a wasteful number, since it uses less digits than its factorization.
32101312220034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232618204521.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 32101312220034 its reverse (43002221310123), we get a palindrome (75103533530157).
The spelling of 32101312220034 in words is "thirty-two trillion, one hundred one billion, three hundred twelve million, two hundred twenty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •