Base | Representation |
---|---|
bin | 1001101011111100110100… |
… | …10101110010010000011001 |
3 | 2210102101110110121220021112 |
4 | 10311332122111302100121 |
5 | 10243000112022114001 |
6 | 113145410311550105 |
7 | 4325653604301335 |
oct | 465763225622031 |
9 | 83371413556245 |
10 | 21301332223001 |
11 | 6872931796076 |
12 | 248041108b335 |
13 | bb69263b8bbc |
14 | 538dc07147c5 |
15 | 26e16ac13cbb |
hex | 135f9a572419 |
21301332223001 has 8 divisors (see below), whose sum is σ = 22632010627680. Its totient is φ = 19991609383968.
The previous prime is 21301332222997. The next prime is 21301332223007. The reversal of 21301332223001 is 10032223310312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21301332223001 - 22 = 21301332222997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21301332223007) 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 7 ways as a sum of consecutive naturals, for example, 5238889316 + ... + 5238893381.
It is an arithmetic number, because the mean of its divisors is an integer number (2829001328460).
Almost surely, 221301332223001 is an apocalyptic number.
It is an amenable number.
21301332223001 is a deficient number, since it is larger than the sum of its proper divisors (1330678404679).
21301332223001 is a wasteful number, since it uses less digits than its factorization.
21301332223001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10477782823.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 21301332223001 its reverse (10032223310312), we get a palindrome (31333555533313).
The spelling of 21301332223001 in words is "twenty-one trillion, three hundred one billion, three hundred thirty-two million, two hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •