Base | Representation |
---|---|
bin | 1001000110101010001111… |
… | …0000100010100011001000 |
3 | 1022102221121120220111000212 |
4 | 2101222203300202203020 |
5 | 2303001010412212222 |
6 | 33142312410220252 |
7 | 2052125441256014 |
oct | 221524360424310 |
9 | 38387546814025 |
10 | 10010021210312 |
11 | 320a254015712 |
12 | 1158013a24688 |
13 | 577c30360c76 |
14 | 2686b8013544 |
15 | 1255b4ae06e2 |
hex | 91aa3c228c8 |
10010021210312 has 8 divisors (see below), whose sum is σ = 18768789769350. Its totient is φ = 5005010605152.
The previous prime is 10010021210311. The next prime is 10010021210369. The reversal of 10010021210312 is 21301212001001.
It can be written as a sum of positive squares in only one way, i.e., 9684133220356 + 325887989956 = 3111934^2 + 570866^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×100100212103122 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10010021210311) 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 as a sum of consecutive naturals, namely, 625626325637 + ... + 625626325652.
Almost surely, 210010021210312 is an apocalyptic number.
It is an amenable number.
10010021210312 is a deficient number, since it is larger than the sum of its proper divisors (8758768559038).
10010021210312 is a wasteful number, since it uses less digits than its factorization.
10010021210312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1251252651295 (or 1251252651291 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10010021210312 its reverse (21301212001001), we get a palindrome (31311233211313).
The spelling of 10010021210312 in words is "ten trillion, ten billion, twenty-one million, two hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •