Base | Representation |
---|---|
bin | 10110100110100011110… |
… | …010011110110111000001 |
3 | 12111111011100100220000220 |
4 | 112212203302132313001 |
5 | 200422004131114130 |
6 | 3145313341133253 |
7 | 220134341425530 |
oct | 26464362366701 |
9 | 5444140326026 |
10 | 1553231113665 |
11 | 5497a351aa10 |
12 | 211039b5a229 |
13 | b36136c99ba |
14 | 55269164317 |
15 | 2a60a736410 |
hex | 169a3c9edc1 |
1553231113665 has 64 divisors (see below), whose sum is σ = 3133207111680. Its totient is φ = 638245808640.
The previous prime is 1553231113607. The next prime is 1553231113667. The reversal of 1553231113665 is 5663111323551.
It is not a de Polignac number, because 1553231113665 - 28 = 1553231113409 is a prime.
It is a super-2 number, since 2×15532311136652 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1553231113667) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7452199 + ... + 7657788.
It is an arithmetic number, because the mean of its divisors is an integer number (48956361120).
Almost surely, 21553231113665 is an apocalyptic number.
1553231113665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1553231113665 is an abundant number, since it is smaller than the sum of its proper divisors (1579975998015).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1553231113665 is a wasteful number, since it uses less digits than its factorization.
1553231113665 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15110102.
The product of its digits is 243000, while the sum is 42.
The spelling of 1553231113665 in words is "one trillion, five hundred fifty-three billion, two hundred thirty-one million, one hundred thirteen thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.286 sec. • engine limits •