Base | Representation |
---|---|
bin | 1001100110101011011101… |
… | …01000001011011111001001 |
3 | 2202210001221202121212122020 |
4 | 10303111232220023133021 |
5 | 10232013142304033001 |
6 | 112530253550515053 |
7 | 4306612332550353 |
oct | 463255650133711 |
9 | 82701852555566 |
10 | 21120210221001 |
11 | 6803038081211 |
12 | 24512a3805a89 |
13 | ba282018c258 |
14 | 53031b8d00d3 |
15 | 2695b9c7a736 |
hex | 13356ea0b7c9 |
21120210221001 has 32 divisors (see below), whose sum is σ = 29842636723200. Its totient is φ = 13262689950720.
The previous prime is 21120210220999. The next prime is 21120210221003. The reversal of 21120210221001 is 10012201202112.
It is an interprime number because it is at equal distance from previous prime (21120210220999) and next prime (21120210221003).
It is not a de Polignac number, because 21120210221001 - 21 = 21120210220999 is a prime.
It is a super-2 number, since 2×211202102210012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21120210221003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 223307560 + ... + 223402118.
It is an arithmetic number, because the mean of its divisors is an integer number (932582397600).
Almost surely, 221120210221001 is an apocalyptic number.
It is an amenable number.
21120210221001 is a deficient number, since it is larger than the sum of its proper divisors (8722426502199).
21120210221001 is a wasteful number, since it uses less digits than its factorization.
21120210221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157249.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 21120210221001 its reverse (10012201202112), we get a palindrome (31132411423113).
The spelling of 21120210221001 in words is "twenty-one trillion, one hundred twenty billion, two hundred ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •