Base | Representation |
---|---|
bin | 100010110101100100100101… |
… | …111010011011110101010001 |
3 | 202002111012201002111112210000 |
4 | 202311210211322123311101 |
5 | 130040233312113104203 |
6 | 1301510000142400213 |
7 | 44162263432365420 |
oct | 4265444572336521 |
9 | 662435632445700 |
10 | 153215004425553 |
11 | 44901133767134 |
12 | 15226116b90069 |
13 | 67651611234a5 |
14 | 29b990804b2b7 |
15 | 12aa7194d34a3 |
hex | 8b5925e9bd51 |
153215004425553 has 40 divisors (see below), whose sum is σ = 261574467276672. Its totient is φ = 87551077699584.
The previous prime is 153215004425519. The next prime is 153215004425591. The reversal of 153215004425553 is 355524400512351.
153215004425553 is a `hidden beast` number, since 1 + 5 + 3 + 2 + 1 + 50 + 0 + 4 + 42 + 5 + 553 = 666.
It is not a de Polignac number, because 153215004425553 - 224 = 153214987648337 is a prime.
It is a super-2 number, since 2×1532150044255532 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 153215004425499 and 153215004425508.
It is not an unprimeable number, because it can be changed into a prime (153215004425753) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 215341276 + ... + 216051602.
Almost surely, 2153215004425553 is an apocalyptic number.
It is an amenable number.
153215004425553 is a deficient number, since it is larger than the sum of its proper divisors (108359462851119).
153215004425553 is an equidigital number, since it uses as much as digits as its factorization.
153215004425553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090763 (or 1090754 counting only the distinct ones).
The product of its (nonzero) digits is 1800000, while the sum is 45.
The spelling of 153215004425553 in words is "one hundred fifty-three trillion, two hundred fifteen billion, four million, four hundred twenty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •