Base | Representation |
---|---|
bin | 10011100000011010100… |
… | …001100110111001100010 |
3 | 11202010222222212001011012 |
4 | 103200122201212321202 |
5 | 133430243023022200 |
6 | 2503450003220522 |
7 | 165563133630611 |
oct | 23403241467142 |
9 | 4663888761135 |
10 | 1340474814050 |
11 | 4775460a5039 |
12 | 197962377742 |
13 | 99538654058 |
14 | 48c44c33878 |
15 | 24d0744ca35 |
hex | 1381a866e62 |
1340474814050 has 96 divisors (see below), whose sum is σ = 2732056387200. Its totient is φ = 487055528960.
The previous prime is 1340474814047. The next prime is 1340474814053. The reversal of 1340474814050 is 504184740431.
It is an interprime number because it is at equal distance from previous prime (1340474814047) and next prime (1340474814053).
It is a junction number, because it is equal to n+sod(n) for n = 1340474813989 and 1340474814007.
It is not an unprimeable number, because it can be changed into a prime (1340474814053) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 72437099 + ... + 72455601.
It is an arithmetic number, because the mean of its divisors is an integer number (28458920700).
Almost surely, 21340474814050 is an apocalyptic number.
1340474814050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1340474814050 is an abundant number, since it is smaller than the sum of its proper divisors (1391581573150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1340474814050 is a wasteful number, since it uses less digits than its factorization.
1340474814050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21500 (or 21495 counting only the distinct ones).
The product of its (nonzero) digits is 215040, while the sum is 41.
The spelling of 1340474814050 in words is "one trillion, three hundred forty billion, four hundred seventy-four million, eight hundred fourteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •