Base | Representation |
---|---|
bin | 11101011101010000111… |
… | …11110011000000100000 |
3 | 10120202112001220211112221 |
4 | 32232220133303000200 |
5 | 113040332410102430 |
6 | 2052550031200424 |
7 | 133060606636534 |
oct | 16565037630040 |
9 | 3522461824487 |
10 | 1012144222240 |
11 | 3602800328a8 |
12 | 1441b1076114 |
13 | 745a2288468 |
14 | 36db9287bc4 |
15 | 1b4dc9c457a |
hex | eba87f3020 |
1012144222240 has 48 divisors (see below), whose sum is σ = 2401724691072. Its totient is φ = 403074160384.
The previous prime is 1012144222231. The next prime is 1012144222253. The reversal of 1012144222240 is 422224412101.
It is a super-2 number, since 2×10121442222402 (a number of 25 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 13897384 + ... + 13970023.
It is an arithmetic number, because the mean of its divisors is an integer number (50035931064).
Almost surely, 21012144222240 is an apocalyptic number.
1012144222240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1012144222240 is an abundant number, since it is smaller than the sum of its proper divisors (1389580468832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012144222240 is a wasteful number, since it uses less digits than its factorization.
1012144222240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27867649 (or 27867641 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 25.
Adding to 1012144222240 its reverse (422224412101), we get a palindrome (1434368634341).
The spelling of 1012144222240 in words is "one trillion, twelve billion, one hundred forty-four million, two hundred twenty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •