Base | Representation |
---|---|
bin | 111100100010100111… |
… | …1010101001101110000 |
3 | 110102120200000010101221 |
4 | 1321011033111031300 |
5 | 4112230212301330 |
6 | 135420455434424 |
7 | 12251533266046 |
oct | 1710517251560 |
9 | 412520003357 |
10 | 130010665840 |
11 | 501566a4580 |
12 | 21244385a14 |
13 | c34c16a493 |
14 | 6414a84396 |
15 | 35adc6db7a |
hex | 1e453d5370 |
130010665840 has 40 divisors (see below), whose sum is σ = 329754327408. Its totient is φ = 47276605440.
The previous prime is 130010665783. The next prime is 130010665901. The reversal of 130010665840 is 48566010031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 130010665796 and 130010665805.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73868817 + ... + 73870576.
Almost surely, 2130010665840 is an apocalyptic number.
130010665840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130010665840 is an abundant number, since it is smaller than the sum of its proper divisors (199743661568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130010665840 is a wasteful number, since it uses less digits than its factorization.
130010665840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147739417 (or 147739411 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 34.
Adding to 130010665840 its reverse (48566010031), we get a palindrome (178576675871).
The spelling of 130010665840 in words is "one hundred thirty billion, ten million, six hundred sixty-five thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •