Base | Representation |
---|---|
bin | 101111110011001000011111… |
… | …110000010001111100011011 |
3 | 1000120100000201202211102110101 |
4 | 233303020133300101330123 |
5 | 210023234130004120443 |
6 | 2023034353212200231 |
7 | 62165016120010312 |
oct | 5763103760217433 |
9 | 1016300652742411 |
10 | 210222002020123 |
11 | 60a8a717733975 |
12 | 1b6b2523169077 |
13 | 903bb07b14b92 |
14 | 39cab28d7d279 |
15 | 1948553d3384d |
hex | bf321fc11f1b |
210222002020123 has 4 divisors (see below), whose sum is σ = 210223895494288. Its totient is φ = 210220108545960.
The previous prime is 210222002020117. The next prime is 210222002020153. The reversal of 210222002020123 is 321020200222012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 210222002020123 - 217 = 210222001889051 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 210222002020123.
It is not an unprimeable number, because it can be changed into a prime (210222002020153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 946570536 + ... + 946792597.
It is an arithmetic number, because the mean of its divisors is an integer number (52555973873572).
Almost surely, 2210222002020123 is an apocalyptic number.
210222002020123 is a deficient number, since it is larger than the sum of its proper divisors (1893474165).
210222002020123 is a wasteful number, since it uses less digits than its factorization.
210222002020123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1893474164.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 210222002020123 its reverse (321020200222012), we get a palindrome (531242202242135).
The spelling of 210222002020123 in words is "two hundred ten trillion, two hundred twenty-two billion, two million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •