Base | Representation |
---|---|
bin | 10110100110101111111… |
… | …101001000110000100001 |
3 | 12111111200120110020112212 |
4 | 112212233331020300201 |
5 | 200422413404431223 |
6 | 3145345512131505 |
7 | 220142400421535 |
oct | 26465775106041 |
9 | 5444616406485 |
10 | 1553435233313 |
11 | 549898767037 |
12 | 211096396b95 |
13 | b3646a97162 |
14 | 552882d9bc5 |
15 | 2a61d606278 |
hex | 169aff48c21 |
1553435233313 has 4 divisors (see below), whose sum is σ = 1560278560560. Its totient is φ = 1546591906068.
The previous prime is 1553435233309. The next prime is 1553435233327. The reversal of 1553435233313 is 3133325343551.
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 1553435233313 - 22 = 1553435233309 is a prime.
It is a super-4 number, since 4×15534352333134 (a number of 50 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1553435233913) 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, 3421663283 + ... + 3421663736.
It is an arithmetic number, because the mean of its divisors is an integer number (390069640140).
Almost surely, 21553435233313 is an apocalyptic number.
It is an amenable number.
1553435233313 is a deficient number, since it is larger than the sum of its proper divisors (6843327247).
1553435233313 is an equidigital number, since it uses as much as digits as its factorization.
1553435233313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6843327246.
The product of its digits is 729000, while the sum is 41.
The spelling of 1553435233313 in words is "one trillion, five hundred fifty-three billion, four hundred thirty-five million, two hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •