Base | Representation |
---|---|
bin | 1001100110101111010110… |
… | …11000101110011110010001 |
3 | 2202210021100122011102102111 |
4 | 10303113223120232132101 |
5 | 10232031434122301001 |
6 | 112531241401145321 |
7 | 4310015236611550 |
oct | 463275330563621 |
9 | 82707318142374 |
10 | 21122303322001 |
11 | 6803a11627a52 |
12 | 245178878b241 |
13 | ba2a94a02b5b |
14 | 5304798a1d97 |
15 | 26968d8cd851 |
hex | 1335eb62e791 |
21122303322001 has 8 divisors (see below), whose sum is σ = 24411008655360. Its totient is φ = 17901406346208.
The previous prime is 21122303321993. The next prime is 21122303322037. The reversal of 21122303322001 is 10022330322112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21122303322001 - 23 = 21122303321993 is a prime.
It is a super-2 number, since 2×211223033220012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21122303323001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16952088721 + ... + 16952089966.
It is an arithmetic number, because the mean of its divisors is an integer number (3051376081920).
Almost surely, 221122303322001 is an apocalyptic number.
It is an amenable number.
21122303322001 is a deficient number, since it is larger than the sum of its proper divisors (3288705333359).
21122303322001 is an equidigital number, since it uses as much as digits as its factorization.
21122303322001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33904178783.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 21122303322001 its reverse (10022330322112), we get a palindrome (31144633644113).
The spelling of 21122303322001 in words is "twenty-one trillion, one hundred twenty-two billion, three hundred three million, three hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •