Base | Representation |
---|---|
bin | 11110101011111110101… |
… | …10001001011111101101 |
3 | 10201210121012012120111222 |
4 | 33111333112021133231 |
5 | 114233404244000023 |
6 | 2124215234153125 |
7 | 136115046605153 |
oct | 17257726113755 |
9 | 3653535176458 |
10 | 1054403500013 |
11 | 377196318756 |
12 | 1504257227a5 |
13 | 78578425676 |
14 | 390679233d3 |
15 | 1c6629d6cc8 |
hex | f57f5897ed |
1054403500013 has 4 divisors (see below), whose sum is σ = 1067750379840. Its totient is φ = 1041056620188.
The previous prime is 1054403499973. The next prime is 1054403500021. The reversal of 1054403500013 is 3100053044501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1054403500013 - 228 = 1054135064557 is a prime.
It is a super-2 number, since 2×10544035000132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054403500613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6673439795 + ... + 6673439952.
It is an arithmetic number, because the mean of its divisors is an integer number (266937594960).
Almost surely, 21054403500013 is an apocalyptic number.
It is an amenable number.
1054403500013 is a deficient number, since it is larger than the sum of its proper divisors (13346879827).
1054403500013 is an equidigital number, since it uses as much as digits as its factorization.
1054403500013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13346879826.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 1054403500013 its reverse (3100053044501), we get a palindrome (4154456544514).
The spelling of 1054403500013 in words is "one trillion, fifty-four billion, four hundred three million, five hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •