Base | Representation |
---|---|
bin | 11101011011001000110… |
… | …10101110101010000100 |
3 | 10120122120110201010012120 |
4 | 32231210122232222010 |
5 | 113031013010334022 |
6 | 2052240430245540 |
7 | 133020400401123 |
oct | 16554432565204 |
9 | 3518513633176 |
10 | 1011002043012 |
11 | 35a844329725 |
12 | 143b326568b0 |
13 | 7444c75a070 |
14 | 36d0b6c9aba |
15 | 1b4725aad5c |
hex | eb646aea84 |
1011002043012 has 24 divisors (see below), whose sum is σ = 2540466672576. Its totient is φ = 311077551648.
The previous prime is 1011002042971. The next prime is 1011002043067. The reversal of 1011002043012 is 2103402001101.
1011002043012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 1011002042982 and 1011002043000.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3240391008 + ... + 3240391319.
It is an arithmetic number, because the mean of its divisors is an integer number (105852778024).
Almost surely, 21011002043012 is an apocalyptic number.
1011002043012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1011002043012 is an abundant number, since it is smaller than the sum of its proper divisors (1529464629564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011002043012 is a wasteful number, since it uses less digits than its factorization.
1011002043012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6480782347 (or 6480782345 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1011002043012 its reverse (2103402001101), we get a palindrome (3114404044113).
The spelling of 1011002043012 in words is "one trillion, eleven billion, two million, forty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •