Base | Representation |
---|---|
bin | 1110100111001110010010… |
… | …11100110110010100010111 |
3 | 11012202222112210212101022101 |
4 | 13103213021130312110113 |
5 | 13202440443202434221 |
6 | 152202100350542531 |
7 | 6524415136222213 |
oct | 723471134662427 |
9 | 135688483771271 |
10 | 32134030124311 |
11 | a269a69300015 |
12 | 372b959807a47 |
13 | 14c12c27b628b |
14 | 7d141c65b943 |
15 | 3aad2e840d91 |
hex | 1d39c9736517 |
32134030124311 has 2 divisors, whose sum is σ = 32134030124312. Its totient is φ = 32134030124310.
The previous prime is 32134030124297. The next prime is 32134030124327. The reversal of 32134030124311 is 11342103043123.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32134030124311 is a prime.
It is a super-2 number, since 2×321340301243112 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 32134030124311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32134030104311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16067015062155 + 16067015062156.
It is an arithmetic number, because the mean of its divisors is an integer number (16067015062156).
Almost surely, 232134030124311 is an apocalyptic number.
32134030124311 is a deficient number, since it is larger than the sum of its proper divisors (1).
32134030124311 is an equidigital number, since it uses as much as digits as its factorization.
32134030124311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 32134030124311 its reverse (11342103043123), we get a palindrome (43476133167434).
The spelling of 32134030124311 in words is "thirty-two trillion, one hundred thirty-four billion, thirty million, one hundred twenty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •