Base | Representation |
---|---|
bin | 11101011111010011101… |
… | …01000010111000100100 |
3 | 10120212100110101221010020 |
4 | 32233221311002320210 |
5 | 113100104004430312 |
6 | 2053250504155140 |
7 | 133130016353544 |
oct | 16575165027044 |
9 | 3525313357106 |
10 | 1013240311332 |
11 | 360792816857 |
12 | 144458168ab0 |
13 | 74718399ca2 |
14 | 37080a89324 |
15 | 1b553d3678c |
hex | ebe9d42e24 |
1013240311332 has 12 divisors (see below), whose sum is σ = 2364227393136. Its totient is φ = 337746770440.
The previous prime is 1013240311289. The next prime is 1013240311393. The reversal of 1013240311332 is 2331130423101.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×10132403113322 (a number of 25 digits) contains 22 as substring.
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, 42218346294 + ... + 42218346317.
It is an arithmetic number, because the mean of its divisors is an integer number (197018949428).
Almost surely, 21013240311332 is an apocalyptic number.
1013240311332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1013240311332 is an abundant number, since it is smaller than the sum of its proper divisors (1350987081804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013240311332 is a wasteful number, since it uses less digits than its factorization.
1013240311332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84436692618 (or 84436692616 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 1013240311332 its reverse (2331130423101), we get a palindrome (3344370734433).
The spelling of 1013240311332 in words is "one trillion, thirteen billion, two hundred forty million, three hundred eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •