Base | Representation |
---|---|
bin | 10110111101111010111100… |
… | …011010110011111000110100 |
3 | 111020122200011000222101202222 |
4 | 112331322330122303320310 |
5 | 101214440442203342322 |
6 | 554500210500421512 |
7 | 30163614350243021 |
oct | 2675727432637064 |
9 | 436580130871688 |
10 | 101012202012212 |
11 | 2a205041720487 |
12 | b3b4a120a7898 |
13 | 444954338644a |
14 | 1ad3033a20548 |
15 | ba285c3abe42 |
hex | 5bdebc6b3e34 |
101012202012212 has 48 divisors (see below), whose sum is σ = 180735757650000. Its totient is φ = 49380248985600.
The previous prime is 101012202012097. The next prime is 101012202012217. The reversal of 101012202012212 is 212210202210101.
It can be written as a sum of positive squares in 8 ways, for example, as 54573619660816 + 46438582351396 = 7387396^2 + 6814586^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012202012217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118028414 + ... + 118881162.
It is an arithmetic number, because the mean of its divisors is an integer number (3765328284375).
Almost surely, 2101012202012212 is an apocalyptic number.
It is an amenable number.
101012202012212 is a deficient number, since it is larger than the sum of its proper divisors (79723555637788).
101012202012212 is a wasteful number, since it uses less digits than its factorization.
101012202012212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 854756 (or 854754 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101012202012212 its reverse (212210202210101), we get a palindrome (313222404222313).
The spelling of 101012202012212 in words is "one hundred one trillion, twelve billion, two hundred two million, twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •