Base | Representation |
---|---|
bin | 10011000001001001… |
… | …10100111001111100 |
3 | 222100120021221222110 |
4 | 21200210310321330 |
5 | 131402302414322 |
6 | 4405052014020 |
7 | 511006164321 |
oct | 114044647174 |
9 | 28316257873 |
10 | 10210201212 |
11 | 436a435322 |
12 | 1b8b461310 |
13 | c69406aa3 |
14 | 6cc03cb48 |
15 | 3eb57ec0c |
hex | 260934e7c |
10210201212 has 12 divisors (see below), whose sum is σ = 23823802856. Its totient is φ = 3403400400.
The previous prime is 10210201123. The next prime is 10210201213. The reversal of 10210201212 is 21210201201.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 850850101 = 10210201212 / (1 + 0 + 2 + 1 + 0 + 2 + 0 + 1 + 2 + 1 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210201213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 425425039 + ... + 425425062.
Almost surely, 210210201212 is an apocalyptic number.
10210201212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10210201212 is an abundant number, since it is smaller than the sum of its proper divisors (13613601644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210201212 is a wasteful number, since it uses less digits than its factorization.
10210201212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 850850108 (or 850850106 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10210201212 its reverse (21210201201), we get a palindrome (31420402413).
The spelling of 10210201212 in words is "ten billion, two hundred ten million, two hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •