Base | Representation |
---|---|
bin | 10011000100011010110… |
… | …001100001010010100000 |
3 | 11122021102000112100120001 |
4 | 103010122301201102200 |
5 | 132432212014324204 |
6 | 2441555044225344 |
7 | 163450200016246 |
oct | 23043261412240 |
9 | 4567360470501 |
10 | 1310414214304 |
11 | 46581a730578 |
12 | 191b7309b254 |
13 | 96757862020 |
14 | 475d2732796 |
15 | 241483534a4 |
hex | 1311ac614a0 |
1310414214304 has 96 divisors (see below), whose sum is σ = 2833678620864. Its totient is φ = 592859658240.
The previous prime is 1310414214301. The next prime is 1310414214323. The reversal of 1310414214304 is 4034124140131.
It is not an unprimeable number, because it can be changed into a prime (1310414214301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4817619 + ... + 5082349.
It is an arithmetic number, because the mean of its divisors is an integer number (29517485634).
Almost surely, 21310414214304 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 1310414214304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1416839310432).
1310414214304 is an abundant number, since it is smaller than the sum of its proper divisors (1523264406560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310414214304 is a wasteful number, since it uses less digits than its factorization.
1310414214304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264990 (or 264982 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1310414214304 its reverse (4034124140131), we get a palindrome (5344538354435).
The spelling of 1310414214304 in words is "one trillion, three hundred ten billion, four hundred fourteen million, two hundred fourteen thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •