Base | Representation |
---|---|
bin | 111100110101011101… |
… | …1101110100100101000 |
3 | 110111012201222010112002 |
4 | 1321222323232210220 |
5 | 4120024110423112 |
6 | 140003330110132 |
7 | 12303312460601 |
oct | 1715273564450 |
9 | 414181863462 |
10 | 130643061032 |
11 | 50450669430 |
12 | 213a011b348 |
13 | c420199313 |
14 | 6474a60da8 |
15 | 35e953a1c2 |
hex | 1e6aeee928 |
130643061032 has 48 divisors (see below), whose sum is σ = 267994137600. Its totient is φ = 59212655840.
The previous prime is 130643061013. The next prime is 130643061041. The reversal of 130643061032 is 230160346031.
It is a junction number, because it is equal to n+sod(n) for n = 130643060986 and 130643061004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11335769 + ... + 11347287.
It is an arithmetic number, because the mean of its divisors is an integer number (5583211200).
Almost surely, 2130643061032 is an apocalyptic number.
It is an amenable number.
130643061032 is an abundant number, since it is smaller than the sum of its proper divisors (137351076568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130643061032 is a wasteful number, since it uses less digits than its factorization.
130643061032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12254 (or 11891 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 29.
The spelling of 130643061032 in words is "one hundred thirty billion, six hundred forty-three million, sixty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •