Base | Representation |
---|---|
bin | 10011100000111000010… |
… | …001011111001001111100 |
3 | 11202012021202222110112222 |
4 | 103200320101133021330 |
5 | 133432303304421013 |
6 | 2504011312344512 |
7 | 165611404056050 |
oct | 23407021371174 |
9 | 4665252873488 |
10 | 1340973904508 |
11 | 4777818a0097 |
12 | 197a81545138 |
13 | 995b7b7b154 |
14 | 48c9122dc60 |
15 | 24d36186508 |
hex | 1383845f27c |
1340973904508 has 12 divisors (see below), whose sum is σ = 2681947809072. Its totient is φ = 574703101920.
The previous prime is 1340973904507. The next prime is 1340973904541. The reversal of 1340973904508 is 8054093790431.
1340973904508 is an admirable number.
It is a super-2 number, since 2×13409739045082 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1340973904508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1340973904507) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23945962553 + ... + 23945962608.
It is an arithmetic number, because the mean of its divisors is an integer number (223495650756).
Almost surely, 21340973904508 is an apocalyptic number.
It is an amenable number.
1340973904508 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1340973904508 is a wasteful number, since it uses less digits than its factorization.
1340973904508 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47891925172 (or 47891925170 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 53.
The spelling of 1340973904508 in words is "one trillion, three hundred forty billion, nine hundred seventy-three million, nine hundred four thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •