Base | Representation |
---|---|
bin | 10100100011011101100… |
… | …000101010101101001001 |
3 | 12000000211011012221210212 |
4 | 110203131200222231021 |
5 | 141120212143220403 |
6 | 3000513331450505 |
7 | 204022133342102 |
oct | 24433540525511 |
9 | 5000734187725 |
10 | 1412465601353 |
11 | 4a5029011074 |
12 | 1a98b3a56a35 |
13 | a326c36b651 |
14 | 4c513dc73a9 |
15 | 26b1c7014d8 |
hex | 148dd82ab49 |
1412465601353 has 8 divisors (see below), whose sum is σ = 1430472415680. Its totient is φ = 1394568251440.
The previous prime is 1412465601347. The next prime is 1412465601377. The reversal of 1412465601353 is 3531065642141.
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 1412465601353 - 26 = 1412465601289 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 1412465601353.
It is not an unprimeable number, because it can be changed into a prime (1412465601343) 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, 27340133 + ... + 27391746.
It is an arithmetic number, because the mean of its divisors is an integer number (178809051960).
Almost surely, 21412465601353 is an apocalyptic number.
It is an amenable number.
1412465601353 is a deficient number, since it is larger than the sum of its proper divisors (18006814327).
1412465601353 is a wasteful number, since it uses less digits than its factorization.
1412465601353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54732207.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 1412465601353 in words is "one trillion, four hundred twelve billion, four hundred sixty-five million, six hundred one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •