Base | Representation |
---|---|
bin | 11101111010100011… |
… | …111011111110010001 |
3 | 10001220120100111000022 |
4 | 131322203323332101 |
5 | 1011240434341423 |
6 | 22431200433225 |
7 | 2214663045431 |
oct | 357243737621 |
9 | 101816314008 |
10 | 32121012113 |
11 | 12693523903 |
12 | 6285318815 |
13 | 304b92bc58 |
14 | 17aa0042c1 |
15 | c7ee41dc8 |
hex | 77a8fbf91 |
32121012113 has 8 divisors (see below), whose sum is σ = 32193318528. Its totient is φ = 32048740224.
The previous prime is 32121012107. The next prime is 32121012127. The reversal of 32121012113 is 31121012123.
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 32121012113 - 234 = 14941142929 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 32121012091 and 32121012100.
It is not an unprimeable number, because it can be changed into a prime (32121012163) by changing a digit.
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, 2940620 + ... + 2951522.
It is an arithmetic number, because the mean of its divisors is an integer number (4024164816).
Almost surely, 232121012113 is an apocalyptic number.
It is an amenable number.
32121012113 is a deficient number, since it is larger than the sum of its proper divisors (72306415).
32121012113 is a wasteful number, since it uses less digits than its factorization.
32121012113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17263.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 32121012113 its reverse (31121012123), we get a palindrome (63242024236).
The spelling of 32121012113 in words is "thirty-two billion, one hundred twenty-one million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •