Base | Representation |
---|---|
bin | 1001100111101100110110… |
… | …00011010000110001011101 |
3 | 2202220102120021221110001222 |
4 | 10303312123003100301131 |
5 | 10233102041201201123 |
6 | 112554341225343125 |
7 | 4312264301460362 |
oct | 463663303206135 |
9 | 82812507843058 |
10 | 21155315256413 |
11 | 6816a11a42978 |
12 | 2458060337aa5 |
13 | ba5c2609a660 |
14 | 531ccbd3c469 |
15 | 26a471b576c8 |
hex | 133d9b0d0c5d |
21155315256413 has 16 divisors (see below), whose sum is σ = 22869888281856. Its totient is φ = 19453209242880.
The previous prime is 21155315256407. The next prime is 21155315256419. The reversal of 21155315256413 is 31465251355112.
It is an interprime number because it is at equal distance from previous prime (21155315256407) and next prime (21155315256419).
It is a cyclic number.
It is not a de Polignac number, because 21155315256413 - 226 = 21155248147549 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21155315256419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191706293 + ... + 191816613.
It is an arithmetic number, because the mean of its divisors is an integer number (1429368017616).
Almost surely, 221155315256413 is an apocalyptic number.
It is an amenable number.
21155315256413 is a deficient number, since it is larger than the sum of its proper divisors (1714573025443).
21155315256413 is a wasteful number, since it uses less digits than its factorization.
21155315256413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166684.
The product of its digits is 540000, while the sum is 44.
The spelling of 21155315256413 in words is "twenty-one trillion, one hundred fifty-five billion, three hundred fifteen million, two hundred fifty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •