Base | Representation |
---|---|
bin | 1001100111101000100100… |
… | …11000001011001110100111 |
3 | 2202220012122111021011111220 |
4 | 10303310102120023032213 |
5 | 10233032342144311020 |
6 | 112553321514431423 |
7 | 4312153416356133 |
oct | 463642230131647 |
9 | 82805574234456 |
10 | 21153022260135 |
11 | 6815a45675927 |
12 | 2457720432573 |
13 | ba594c00831c |
14 | 531b515b43c3 |
15 | 26a38a6bb240 |
hex | 133d1260b3a7 |
21153022260135 has 8 divisors (see below), whose sum is σ = 33844835616240. Its totient is φ = 11281611872064.
The previous prime is 21153022260079. The next prime is 21153022260179. The reversal of 21153022260135 is 53106222035112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21153022260135 - 29 = 21153022259623 is a prime.
It is a super-2 number, since 2×211530222601352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21153022260096 and 21153022260105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 705100741990 + ... + 705100742019.
It is an arithmetic number, because the mean of its divisors is an integer number (4230604452030).
Almost surely, 221153022260135 is an apocalyptic number.
21153022260135 is a deficient number, since it is larger than the sum of its proper divisors (12691813356105).
21153022260135 is a wasteful number, since it uses less digits than its factorization.
21153022260135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1410201484017.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 21153022260135 its reverse (53106222035112), we get a palindrome (74259244295247).
The spelling of 21153022260135 in words is "twenty-one trillion, one hundred fifty-three billion, twenty-two million, two hundred sixty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •