Base | Representation |
---|---|
bin | 1111011110011101110000… |
… | …11111101110110011001111 |
3 | 11110111102212001010002202220 |
4 | 13233032320133232303033 |
5 | 13430040241012241421 |
6 | 200214050214150423 |
7 | 10111511455243131 |
oct | 757167037566317 |
9 | 143442761102686 |
10 | 34032121212111 |
11 | a930a3a232810 |
12 | 39977a0652413 |
13 | 15cb2a4c06969 |
14 | 859240743051 |
15 | 3e03c0c153c6 |
hex | 1ef3b87eeccf |
34032121212111 has 32 divisors (see below), whose sum is σ = 51179062788096. Its totient is φ = 19928555388000.
The previous prime is 34032121212079. The next prime is 34032121212163. The reversal of 34032121212111 is 11121212123043.
It is not a de Polignac number, because 34032121212111 - 25 = 34032121212079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34032121212191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25715011 + ... + 27006036.
It is an arithmetic number, because the mean of its divisors is an integer number (1599345712128).
Almost surely, 234032121212111 is an apocalyptic number.
34032121212111 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
34032121212111 is a deficient number, since it is larger than the sum of its proper divisors (17146941575985).
34032121212111 is a wasteful number, since it uses less digits than its factorization.
34032121212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52721723.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 34032121212111 its reverse (11121212123043), we get a palindrome (45153333335154).
The spelling of 34032121212111 in words is "thirty-four trillion, thirty-two billion, one hundred twenty-one million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •