Base | Representation |
---|---|
bin | 10011000100010101111… |
… | …111100100010000100000 |
3 | 11122021012102121120111002 |
4 | 103010111333210100200 |
5 | 132432031001313100 |
6 | 2441543101211132 |
7 | 163445204213522 |
oct | 23042577442040 |
9 | 4567172546432 |
10 | 1310334010400 |
11 | 465789430158 |
12 | 191b50260aa8 |
13 | 9674405cbac |
14 | 475c5c15a12 |
15 | 241412ae2d5 |
hex | 13115fe4420 |
1310334010400 has 72 divisors (see below), whose sum is σ = 3387020755860. Its totient is φ = 493302210560.
The previous prime is 1310334010393. The next prime is 1310334010411. The reversal of 1310334010400 is 40104330131.
It can be written as a sum of positive squares in 6 ways, for example, as 662263929616 + 648070080784 = 813796^2 + 805028^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 48160445 + ... + 48187644.
Almost surely, 21310334010400 is an apocalyptic number.
1310334010400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1310334010400 is an abundant number, since it is smaller than the sum of its proper divisors (2076686745460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310334010400 is a wasteful number, since it uses less digits than its factorization.
1310334010400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96348126 (or 96348113 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1310334010400 its reverse (40104330131), we get a palindrome (1350438340531).
The spelling of 1310334010400 in words is "one trillion, three hundred ten billion, three hundred thirty-four million, ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •