Base | Representation |
---|---|
bin | 10011100010110001010… |
… | …111011010010001111100 |
3 | 11202101112100210020101110 |
4 | 103202301113122101330 |
5 | 134000433402004130 |
6 | 2504545044442020 |
7 | 166012633254414 |
oct | 23426127322174 |
9 | 4671470706343 |
10 | 1343005500540 |
11 | 478624658280 |
12 | 1983499a9310 |
13 | 9984ca38a92 |
14 | 49004d91644 |
15 | 24e046daab0 |
hex | 138b15da47c |
1343005500540 has 48 divisors (see below), whose sum is σ = 4102271349120. Its totient is φ = 325577090880.
The previous prime is 1343005500527. The next prime is 1343005500541. The reversal of 1343005500540 is 450055003431.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1343005500498 and 1343005500507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1343005500541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1017427750 + ... + 1017429069.
It is an arithmetic number, because the mean of its divisors is an integer number (85463986440).
Almost surely, 21343005500540 is an apocalyptic number.
1343005500540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1343005500540 is an abundant number, since it is smaller than the sum of its proper divisors (2759265848580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1343005500540 is a wasteful number, since it uses less digits than its factorization.
1343005500540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2034856842 (or 2034856840 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
The spelling of 1343005500540 in words is "one trillion, three hundred forty-three billion, five million, five hundred thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •