Base | Representation |
---|---|
bin | 1100001110011011010… |
… | …1011111011010111111 |
3 | 202002010102210001202001 |
4 | 3003212311133122333 |
5 | 11420120442242343 |
6 | 240253105443131 |
7 | 21113524563460 |
oct | 3034665373277 |
9 | 662112701661 |
10 | 210031212223 |
11 | 8108a164438 |
12 | 348570404a7 |
13 | 16a62617301 |
14 | a24644ad67 |
15 | 56e3e4a44d |
hex | 30e6d5f6bf |
210031212223 has 8 divisors (see below), whose sum is σ = 241112066048. Its totient is φ = 179219457144.
The previous prime is 210031212211. The next prime is 210031212227. The reversal of 210031212223 is 322212130012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210031212223 - 25 = 210031212191 is a prime.
It is a super-3 number, since 3×2100312122233 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 210031212223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210031212227) 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, 67273011 + ... + 67276132.
It is an arithmetic number, because the mean of its divisors is an integer number (30139008256).
Almost surely, 2210031212223 is an apocalyptic number.
210031212223 is a deficient number, since it is larger than the sum of its proper divisors (31080853825).
210031212223 is a wasteful number, since it uses less digits than its factorization.
210031212223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134549373.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 210031212223 its reverse (322212130012), we get a palindrome (532243342235).
The spelling of 210031212223 in words is "two hundred ten billion, thirty-one million, two hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •