Base | Representation |
---|---|
bin | 10000100110001011011… |
… | …010000101111010100000 |
3 | 11001000211202202110011120 |
4 | 100212023122011322200 |
5 | 122141223313101212 |
6 | 2231535120412240 |
7 | 145253532205254 |
oct | 20461332057240 |
9 | 4030752673146 |
10 | 1140505206432 |
11 | 3aa75a502109 |
12 | 165054a77080 |
13 | 8371a716647 |
14 | 3d2b4bc4264 |
15 | 1ea019cd88c |
hex | 1098b685ea0 |
1140505206432 has 24 divisors (see below), whose sum is σ = 2993826167136. Its totient is φ = 380168402112.
The previous prime is 1140505206307. The next prime is 1140505206551. The reversal of 1140505206432 is 2346025050411.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 1140505206393 and 1140505206402.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5940131188 + ... + 5940131379.
It is an arithmetic number, because the mean of its divisors is an integer number (124742756964).
Almost surely, 21140505206432 is an apocalyptic number.
1140505206432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1140505206432 is an abundant number, since it is smaller than the sum of its proper divisors (1853320960704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140505206432 is a wasteful number, since it uses less digits than its factorization.
1140505206432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11880262580 (or 11880262572 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
The spelling of 1140505206432 in words is "one trillion, one hundred forty billion, five hundred five million, two hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •