Base | Representation |
---|---|
bin | 1100001110101110001… |
… | …0001000000101111100 |
3 | 202002022221002000110010 |
4 | 3003223202020011330 |
5 | 11420301131201022 |
6 | 240305002543220 |
7 | 21115502501562 |
oct | 3035342100574 |
9 | 662287060403 |
10 | 210110022012 |
11 | 8111a6a23a0 |
12 | 34879507b10 |
13 | 16a75a4ba17 |
14 | a252ac3a32 |
15 | 56ead1650c |
hex | 30eb88817c |
210110022012 has 48 divisors (see below), whose sum is σ = 534893208192. Its totient is φ = 63661644480.
The previous prime is 210110022007. The next prime is 210110022013. The reversal of 210110022012 is 210220011012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210110022013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 990663 + ... + 1183905.
It is an arithmetic number, because the mean of its divisors is an integer number (11143608504).
Almost surely, 2210110022012 is an apocalyptic number.
210110022012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
210110022012 is an abundant number, since it is smaller than the sum of its proper divisors (324783186180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210110022012 is a wasteful number, since it uses less digits than its factorization.
210110022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201498 (or 201496 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210110022012 its reverse (210220011012), we get a palindrome (420330033024).
The spelling of 210110022012 in words is "two hundred ten billion, one hundred ten million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •