Base | Representation |
---|---|
bin | 10011000110010001111… |
… | …111110001101111011110 |
3 | 11122110120102022100221120 |
4 | 103012101333301233132 |
5 | 133000311044043124 |
6 | 2442525340111410 |
7 | 163550565452250 |
oct | 23062177615736 |
9 | 4573512270846 |
10 | 1312414440414 |
11 | 466656812000 |
12 | 192430b35566 |
13 | 969b608827c |
14 | 47742249cd0 |
15 | 24213c5cd79 |
hex | 13191ff1bde |
1312414440414 has 64 divisors (see below), whose sum is σ = 3299559639552. Its totient is φ = 340886853120.
The previous prime is 1312414440397. The next prime is 1312414440419. The reversal of 1312414440414 is 4140444142131.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312414440419) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11682627 + ... + 11794430.
It is an arithmetic number, because the mean of its divisors is an integer number (51555619368).
Almost surely, 21312414440414 is an apocalyptic number.
1312414440414 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1312414440414 is an abundant number, since it is smaller than the sum of its proper divisors (1987145199138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312414440414 is a wasteful number, since it uses less digits than its factorization.
1312414440414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23477102 (or 23477080 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 1312414440414 its reverse (4140444142131), we get a palindrome (5452858582545).
The spelling of 1312414440414 in words is "one trillion, three hundred twelve billion, four hundred fourteen million, four hundred forty thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •