Base | Representation |
---|---|
bin | 1110100111100001000100… |
… | …11001110000010101110011 |
3 | 11012210221120110111002012001 |
4 | 13103300202121300111303 |
5 | 13203122120234421321 |
6 | 152210445033314431 |
7 | 6525223033302001 |
oct | 723604231602563 |
9 | 135727513432161 |
10 | 32144112420211 |
11 | a273272514170 |
12 | 37318b2265a17 |
13 | 14c223b558b3c |
14 | 7d1ad76c3a71 |
15 | 3ab21ea57c91 |
hex | 1d3c22670573 |
32144112420211 has 8 divisors (see below), whose sum is σ = 35075930169024. Its totient is φ = 29213898956520.
The previous prime is 32144112420151. The next prime is 32144112420257. The reversal of 32144112420211 is 11202421144123.
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 32144112420211 - 235 = 32109752681843 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 32144112420211.
It is not an unprimeable number, because it can be changed into a prime (32144116420211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 401029381 + ... + 401109526.
It is an arithmetic number, because the mean of its divisors is an integer number (4384491271128).
Almost surely, 232144112420211 is an apocalyptic number.
32144112420211 is a deficient number, since it is larger than the sum of its proper divisors (2931817748813).
32144112420211 is a wasteful number, since it uses less digits than its factorization.
32144112420211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 802142561.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 32144112420211 its reverse (11202421144123), we get a palindrome (43346533564334).
The spelling of 32144112420211 in words is "thirty-two trillion, one hundred forty-four billion, one hundred twelve million, four hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •