Base | Representation |
---|---|
bin | 101111110001100001000111… |
… | …101000110011111011100001 |
3 | 1000112221102012222201012220111 |
4 | 233301201013220303323201 |
5 | 210014424313003013441 |
6 | 2022511354540411321 |
7 | 62154006333266464 |
oct | 5761410750637341 |
9 | 1015842188635814 |
10 | 210111002001121 |
11 | 60a47637057781 |
12 | 1b694b05546b41 |
13 | 90314c83a2270 |
14 | 39c55d90452db |
15 | 1945709054081 |
hex | bf1847a33ee1 |
210111002001121 has 8 divisors (see below), whose sum is σ = 226956992173184. Its totient is φ = 193362669743760.
The previous prime is 210111002001029. The next prime is 210111002001139. The reversal of 210111002001121 is 121100200111012.
It is a happy number.
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 210111002001121 - 221 = 210110999903969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (210111002001161) 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, 24414474201 + ... + 24414482806.
It is an arithmetic number, because the mean of its divisors is an integer number (28369624021648).
Almost surely, 2210111002001121 is an apocalyptic number.
It is an amenable number.
210111002001121 is a deficient number, since it is larger than the sum of its proper divisors (16845990172063).
210111002001121 is a wasteful number, since it uses less digits than its factorization.
210111002001121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48828957351.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 210111002001121 its reverse (121100200111012), we get a palindrome (331211202112133).
The spelling of 210111002001121 in words is "two hundred ten trillion, one hundred eleven billion, two million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •