Base | Representation |
---|---|
bin | 10011100000000110001… |
… | …101100101101110001000 |
3 | 11202010010020121000101022 |
4 | 103200012031211232020 |
5 | 133424043302201044 |
6 | 2503352111012012 |
7 | 165551525144060 |
oct | 23400615455610 |
9 | 4663106530338 |
10 | 1340134022024 |
11 | 477390799a36 |
12 | 19788820a008 |
13 | 994b2b73075 |
14 | 48c118823a0 |
15 | 24cd75823ee |
hex | 13806365b88 |
1340134022024 has 64 divisors (see below), whose sum is σ = 2875446119040. Its totient is φ = 573597573120.
The previous prime is 1340134021999. The next prime is 1340134022047. The reversal of 1340134022024 is 4202204310431.
It is a junction number, because it is equal to n+sod(n) for n = 1340134021984 and 1340134022002.
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 15 ways as a sum of consecutive naturals, for example, 268400072 + ... + 268405064.
It is an arithmetic number, because the mean of its divisors is an integer number (44928845610).
Almost surely, 21340134022024 is an apocalyptic number.
1340134022024 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1340134022024 is an abundant number, since it is smaller than the sum of its proper divisors (1535312097016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1340134022024 is a wasteful number, since it uses less digits than its factorization.
1340134022024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10270 (or 10266 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 1340134022024 its reverse (4202204310431), we get a palindrome (5542338332455).
The spelling of 1340134022024 in words is "one trillion, three hundred forty billion, one hundred thirty-four million, twenty-two thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •