Base | Representation |
---|---|
bin | 11101001000100001111… |
… | …01101111100011110100 |
3 | 10112200210020200101220000 |
4 | 32210100331233203310 |
5 | 112400033033013022 |
6 | 2043505241111300 |
7 | 132215003422212 |
oct | 16442075574364 |
9 | 3480706611800 |
10 | 1001012001012 |
11 | 3565881a6271 |
12 | 142004a88530 |
13 | 73519b482ca |
14 | 366409d9cb2 |
15 | 1b08a5186ac |
hex | e910f6f8f4 |
1001012001012 has 30 divisors (see below), whose sum is σ = 2616843102258. Its totient is φ = 333670666896.
The previous prime is 1001012000969. The next prime is 1001012001037. The reversal of 1001012001012 is 2101002101001.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 807830654436 + 193181346576 = 898794^2 + 439524^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1001012000985 and 1001012001003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1544771283 + ... + 1544771930.
Almost surely, 21001012001012 is an apocalyptic number.
1001012001012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1001012001012 is an abundant number, since it is smaller than the sum of its proper divisors (1615831101246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001012001012 is a wasteful number, since it uses less digits than its factorization.
1001012001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3089543229 (or 3089543218 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1001012001012 its reverse (2101002101001), we get a palindrome (3102014102013).
The spelling of 1001012001012 in words is "one trillion, one billion, twelve million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •