Base | Representation |
---|---|
bin | 101110110001011000101… |
… | …010001110000100111000 |
3 | 102101021012202110200222001 |
4 | 232301120222032010320 |
5 | 410130010442000440 |
6 | 10500314150310344 |
7 | 451132651504414 |
oct | 56613052160470 |
9 | 12337182420861 |
10 | 3214123000120 |
11 | 102a1137069aa |
12 | 43ab033583b4 |
13 | 1a4123a95586 |
14 | b17c894bd44 |
15 | 589179e5b9a |
hex | 2ec58a8e138 |
3214123000120 has 32 divisors (see below), whose sum is σ = 7237952583120. Its totient is φ = 1284551274240.
The previous prime is 3214123000111. The next prime is 3214123000129. The reversal of 3214123000120 is 210003214123.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (3214123000111) and next prime (3214123000129).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3214123000129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34262757 + ... + 34356436.
Almost surely, 23214123000120 is an apocalyptic number.
It is an amenable number.
3214123000120 is an abundant number, since it is smaller than the sum of its proper divisors (4023829583000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3214123000120 is a wasteful number, since it uses less digits than its factorization.
3214123000120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68620375 (or 68620371 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 3214123000120 its reverse (210003214123), we get a palindrome (3424126214243).
The spelling of 3214123000120 in words is "three trillion, two hundred fourteen billion, one hundred twenty-three million, one hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •