Base | Representation |
---|---|
bin | 11101011101000001000… |
… | …11111110111100111100 |
3 | 10120202011210102121221010 |
4 | 32232200203332330330 |
5 | 113040044320231022 |
6 | 2052524514035220 |
7 | 133054402302111 |
oct | 16564043767474 |
9 | 3522153377833 |
10 | 1012011102012 |
11 | 36021197a689 |
12 | 144174578b10 |
13 | 745808196b1 |
14 | 36da5714908 |
15 | 1b4d0e7b50c |
hex | eba08fef3c |
1012011102012 has 12 divisors (see below), whose sum is σ = 2361359238056. Its totient is φ = 337337034000.
The previous prime is 1012011101977. The next prime is 1012011102023. The reversal of 1012011102012 is 2102011102101.
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: 84334258501 = 1012011102012 / (1 + 0 + 1 + 2 + 0 + 1 + 1 + 1 + 0 + 2 + 0 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42167129239 + ... + 42167129262.
Almost surely, 21012011102012 is an apocalyptic number.
1012011102012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012011102012 is an abundant number, since it is smaller than the sum of its proper divisors (1349348136044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012011102012 is a wasteful number, since it uses less digits than its factorization.
1012011102012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84334258508 (or 84334258506 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1012011102012 its reverse (2102011102101), we get a palindrome (3114022204113).
The spelling of 1012011102012 in words is "one trillion, twelve billion, eleven million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •