Base | Representation |
---|---|
bin | 101111000010101010… |
… | …0100010100111100100 |
3 | 100122202022211121222110 |
4 | 1132011110202213210 |
5 | 3123342334032322 |
6 | 114224114401020 |
7 | 10204252231224 |
oct | 1360524424744 |
9 | 318668747873 |
10 | 101021002212 |
11 | 3992a7a4189 |
12 | 176b3890170 |
13 | 96ac1c1270 |
14 | 4c648b8084 |
15 | 2963bb8c0c |
hex | 17855229e4 |
101021002212 has 48 divisors (see below), whose sum is σ = 256220096832. Its totient is φ = 30792881280.
The previous prime is 101021002211. The next prime is 101021002223. The reversal of 101021002212 is 212200120101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (101021002211) 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, 3009339 + ... + 3042722.
It is an arithmetic number, because the mean of its divisors is an integer number (5337918684).
Almost surely, 2101021002212 is an apocalyptic number.
101021002212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101021002212 is an abundant number, since it is smaller than the sum of its proper divisors (155199094620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021002212 is a wasteful number, since it uses less digits than its factorization.
101021002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6052188 (or 6052186 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101021002212 its reverse (212200120101), we get a palindrome (313221122313).
The spelling of 101021002212 in words is "one hundred one billion, twenty-one million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •