Base | Representation |
---|---|
bin | 101101101100111100000010… |
… | …000111111011110110111010 |
3 | 222100200102200020102200200012 |
4 | 231230330002013323312322 |
5 | 202321141412242320442 |
6 | 1551254115523341522 |
7 | 60223533404130620 |
oct | 5554740207736672 |
9 | 870612606380605 |
10 | 201000210120122 |
11 | 5905478a603636 |
12 | 1a66322b8218a2 |
13 | 8820313c4614a |
14 | 378c667d25510 |
15 | 1838723ead582 |
hex | b6cf021fbdba |
201000210120122 has 8 divisors (see below), whose sum is σ = 344571788777376. Its totient is φ = 86142947194332.
The previous prime is 201000210120103. The next prime is 201000210120137. The reversal of 201000210120122 is 221021012000102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 14357157865723 = 201000210120122 / (2 + 0 + 1 + 0 + 0 + 0 + 2 + 1 + 0 + 1 + 2 + 0 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 201000210120097 and 201000210120106.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7178578932848 + ... + 7178578932875.
It is an arithmetic number, because the mean of its divisors is an integer number (43071473597172).
Almost surely, 2201000210120122 is an apocalyptic number.
201000210120122 is a deficient number, since it is larger than the sum of its proper divisors (143571578657254).
201000210120122 is a wasteful number, since it uses less digits than its factorization.
201000210120122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14357157865732.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201000210120122 its reverse (221021012000102), we get a palindrome (422021222120224).
The spelling of 201000210120122 in words is "two hundred one trillion, two hundred ten million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •