Base | Representation |
---|---|
bin | 10010111010101110101… |
… | …001010110110001000101 |
3 | 11121021112221112200011212 |
4 | 102322232221112301011 |
5 | 132244410102401013 |
6 | 2433114430141205 |
7 | 162631315243361 |
oct | 22725651266105 |
9 | 4537487480155 |
10 | 1300010200133 |
11 | 461370959757 |
12 | 18bb4a951805 |
13 | 9578a259118 |
14 | 46cc6a822a1 |
15 | 23c39c8c6a8 |
hex | 12eaea56c45 |
1300010200133 has 8 divisors (see below), whose sum is σ = 1305030876408. Its totient is φ = 1294993495744.
The previous prime is 1300010200123. The next prime is 1300010200163. The reversal of 1300010200133 is 3310020100031.
It can be written as a sum of positive squares in 4 ways, for example, as 658796825569 + 641213374564 = 811663^2 + 800758^2 .
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 1300010200133 - 28 = 1300010199877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300010200123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 336266 + ... + 1647147.
It is an arithmetic number, because the mean of its divisors is an integer number (163128859551).
Almost surely, 21300010200133 is an apocalyptic number.
It is an amenable number.
1300010200133 is a deficient number, since it is larger than the sum of its proper divisors (5020676275).
1300010200133 is a wasteful number, since it uses less digits than its factorization.
1300010200133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1985943.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 1300010200133 its reverse (3310020100031), we get a palindrome (4610030300164).
The spelling of 1300010200133 in words is "one trillion, three hundred billion, ten million, two hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •