Base | Representation |
---|---|
bin | 10000011101000000001… |
… | …001000011011000100111 |
3 | 11000002102010011210210210 |
4 | 100131000021003120213 |
5 | 122011034020420311 |
6 | 2223225315150503 |
7 | 144454423540041 |
oct | 20350011033047 |
9 | 4002363153723 |
10 | 1130652513831 |
11 | 3a6563960355 |
12 | 1631652a5433 |
13 | 8280a3c4619 |
14 | 3ca1c448a91 |
15 | 1e626a1c3a6 |
hex | 10740243627 |
1130652513831 has 8 divisors (see below), whose sum is σ = 1508033087344. Its totient is φ = 753520141440.
The previous prime is 1130652513829. The next prime is 1130652513839. The reversal of 1130652513831 is 1383152560311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1130652513831 - 21 = 1130652513829 is a prime.
It is a super-3 number, since 3×11306525138313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1130652513831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130652513839) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62039650 + ... + 62057871.
It is an arithmetic number, because the mean of its divisors is an integer number (188504135918).
Almost surely, 21130652513831 is an apocalyptic number.
1130652513831 is a deficient number, since it is larger than the sum of its proper divisors (377380573513).
1130652513831 is a wasteful number, since it uses less digits than its factorization.
1130652513831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124100561.
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 1130652513831 in words is "one trillion, one hundred thirty billion, six hundred fifty-two million, five hundred thirteen thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •