Base | Representation |
---|---|
bin | 11101011101001110001… |
… | …11010010111000111100 |
3 | 10120202110110021010211020 |
4 | 32232213013102320330 |
5 | 113040310440201022 |
6 | 2052543442024140 |
7 | 133060205511432 |
oct | 16564707227074 |
9 | 3522413233736 |
10 | 1012121022012 |
11 | 360268a27161 |
12 | 1441a5348050 |
13 | 7459a524509 |
14 | 36db6168d52 |
15 | 1b4da94035c |
hex | eba71d2e3c |
1012121022012 has 24 divisors (see below), whose sum is σ = 2361633657936. Its totient is φ = 337371111168.
The previous prime is 1012121021999. The next prime is 1012121022043. The reversal of 1012121022012 is 2102201212101.
It is a junction number, because it is equal to n+sod(n) for n = 1012121021982 and 1012121022000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1993858 + ... + 2449430.
It is an arithmetic number, because the mean of its divisors is an integer number (98401402414).
Almost surely, 21012121022012 is an apocalyptic number.
1012121022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012121022012 is an abundant number, since it is smaller than the sum of its proper divisors (1349512635924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012121022012 is a wasteful number, since it uses less digits than its factorization.
1012121022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640717 (or 640715 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1012121022012 its reverse (2102201212101), we get a palindrome (3114322234113).
The spelling of 1012121022012 in words is "one trillion, twelve billion, one hundred twenty-one million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •