Base | Representation |
---|---|
bin | 1100001111001001000… |
… | …1100110011000000000 |
3 | 202002121210220111121000 |
4 | 3003302101212120000 |
5 | 11421014110130422 |
6 | 240324123132000 |
7 | 21121345060032 |
oct | 3036221463000 |
9 | 662553814530 |
10 | 210223130112 |
11 | 81178527166 |
12 | 348ab374000 |
13 | 16a933019a8 |
14 | a263b27c52 |
15 | 5705c09cac |
hex | 30f2466600 |
210223130112 has 80 divisors (see below), whose sum is σ = 622275104880. Its totient is φ = 70074372096.
The previous prime is 210223130107. The next prime is 210223130123. The reversal of 210223130112 is 211031322012.
210223130112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2102231301122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7589733 + ... + 7617380.
It is an arithmetic number, because the mean of its divisors is an integer number (7778438811).
Almost surely, 2210223130112 is an apocalyptic number.
It is an amenable number.
210223130112 is an abundant number, since it is smaller than the sum of its proper divisors (412051974768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210223130112 is an equidigital number, since it uses as much as digits as its factorization.
210223130112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15207140 (or 15207118 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 210223130112 its reverse (211031322012), we get a palindrome (421254452124).
The spelling of 210223130112 in words is "two hundred ten billion, two hundred twenty-three million, one hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •