Base | Representation |
---|---|
bin | 11101011011100000011… |
… | …01111000000001111000 |
3 | 10120200002021012101022022 |
4 | 32231300031320001320 |
5 | 113031414200000440 |
6 | 2052312221214012 |
7 | 133025323116422 |
oct | 16556015700170 |
9 | 3520067171268 |
10 | 1011200000120 |
11 | 35a936046842 |
12 | 143b88a01308 |
13 | 7448177a54b |
14 | 36d29ad9812 |
15 | 1b484b5ecb5 |
hex | eb70378078 |
1011200000120 has 16 divisors (see below), whose sum is σ = 2275200000360. Its totient is φ = 404480000032.
The previous prime is 1011200000119. The next prime is 1011200000147. The reversal of 1011200000120 is 210000021101.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a junction number, because it is equal to n+sod(n) for n = 1011200000098 and 1011200000107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12639999962 + ... + 12640000041.
Almost surely, 21011200000120 is an apocalyptic number.
1011200000120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1011200000120 is an abundant number, since it is smaller than the sum of its proper divisors (1264000000240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011200000120 is a wasteful number, since it uses less digits than its factorization.
1011200000120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25280000014 (or 25280000010 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1011200000120 its reverse (210000021101), we get a palindrome (1221200021221).
The spelling of 1011200000120 in words is "one trillion, eleven billion, two hundred million, one hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •