Base | Representation |
---|---|
bin | 10110100110011011111… |
… | …110010111110111010101 |
3 | 12111110211012200021202012 |
4 | 112212123332113313111 |
5 | 200421222100404023 |
6 | 3145252335154005 |
7 | 220131160202063 |
oct | 26463376276725 |
9 | 5443735607665 |
10 | 1553100013013 |
11 | 54973651706a |
12 | 211002075905 |
13 | b35c24b7253 |
14 | 55255999033 |
15 | 2a5ede8b978 |
hex | 1699bf97dd5 |
1553100013013 has 4 divisors (see below), whose sum is σ = 1553133068928. Its totient is φ = 1553066957100.
The previous prime is 1553100012973. The next prime is 1553100013019. The reversal of 1553100013013 is 3103100013551.
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 1553100013013 - 214 = 1553099996629 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1553100013013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1553100013019) 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, 16457381 + ... + 16551482.
It is an arithmetic number, because the mean of its divisors is an integer number (388283267232).
Almost surely, 21553100013013 is an apocalyptic number.
It is an amenable number.
1553100013013 is a deficient number, since it is larger than the sum of its proper divisors (33055915).
1553100013013 is an equidigital number, since it uses as much as digits as its factorization.
1553100013013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33055914.
The product of its (nonzero) digits is 675, while the sum is 23.
Adding to 1553100013013 its reverse (3103100013551), we get a palindrome (4656200026564).
The spelling of 1553100013013 in words is "one trillion, five hundred fifty-three billion, one hundred million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •