Base | Representation |
---|---|
bin | 1100001111100000111… |
… | …0101001110011010100 |
3 | 202002212202212111010222 |
4 | 3003320032221303110 |
5 | 11421220143133022 |
6 | 240342052133512 |
7 | 21124000116116 |
oct | 3037016516324 |
9 | 662782774128 |
10 | 210323021012 |
11 | 81219953725 |
12 | 34918907298 |
13 | 16aaac07930 |
14 | a2730cb3b6 |
15 | 570e88c242 |
hex | 30f83a9cd4 |
210323021012 has 24 divisors (see below), whose sum is σ = 397031072256. Its totient is φ = 96912227808.
The previous prime is 210323020993. The next prime is 210323021017. The reversal of 210323021012 is 210120323012.
210323021012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2103230210122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210323021017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3300128 + ... + 3363255.
It is an arithmetic number, because the mean of its divisors is an integer number (16542961344).
Almost surely, 2210323021012 is an apocalyptic number.
It is an amenable number.
210323021012 is a deficient number, since it is larger than the sum of its proper divisors (186708051244).
210323021012 is a wasteful number, since it uses less digits than its factorization.
210323021012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6664007 (or 6664005 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 210323021012 its reverse (210120323012), we get a palindrome (420443344024).
The spelling of 210323021012 in words is "two hundred ten billion, three hundred twenty-three million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •