Base | Representation |
---|---|
bin | 10001101011010010100… |
… | …001001110110110110000 |
3 | 11022010101102020221020102 |
4 | 101223102201032312300 |
5 | 124400212423020212 |
6 | 2330010432531532 |
7 | 153521466425033 |
oct | 21532241166660 |
9 | 4263342227212 |
10 | 1214712704432 |
11 | 42917a721757 |
12 | 1775049b0ba8 |
13 | 8a715763786 |
14 | 42b1452501a |
15 | 218e66a05c2 |
hex | 11ad284edb0 |
1214712704432 has 60 divisors (see below), whose sum is σ = 2498980195656. Its totient is φ = 570020774400.
The previous prime is 1214712704411. The next prime is 1214712704437. The reversal of 1214712704432 is 2344072174121.
It is not an unprimeable number, because it can be changed into a prime (1214712704437) 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 11 ways as a sum of consecutive naturals, for example, 35038307 + ... + 35072957.
Almost surely, 21214712704432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1214712704432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1249490097828).
1214712704432 is an abundant number, since it is smaller than the sum of its proper divisors (1284267491224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1214712704432 is an equidigital number, since it uses as much as digits as its factorization.
1214712704432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35394 (or 35029 counting only the distinct ones).
The product of its (nonzero) digits is 75264, while the sum is 38.
Adding to 1214712704432 its reverse (2344072174121), we get a palindrome (3558784878553).
The spelling of 1214712704432 in words is "one trillion, two hundred fourteen billion, seven hundred twelve million, seven hundred four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •