Base | Representation |
---|---|
bin | 11101101011000110010000… |
… | …010011100010101111011011 |
3 | 122010002011012222222202020112 |
4 | 131223012100103202233123 |
5 | 114101143221044043344 |
6 | 1141321100450314535 |
7 | 36326450421534614 |
oct | 3553062023425733 |
9 | 563064188882215 |
10 | 130505002331099 |
11 | 38645951615060 |
12 | 127788b1288a4b |
13 | 57a8751b99896 |
14 | 24326938ccc0b |
15 | 1014b04443c9e |
hex | 76b1904e2bdb |
130505002331099 has 8 divisors (see below), whose sum is σ = 143091779208048. Its totient is φ = 118038673080160.
The previous prime is 130505002331083. The next prime is 130505002331113. The reversal of 130505002331099 is 990133200505031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130505002331099 - 24 = 130505002331083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (130505002331069) 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, 30111904232 + ... + 30111908565.
It is an arithmetic number, because the mean of its divisors is an integer number (17886472401006).
Almost surely, 2130505002331099 is an apocalyptic number.
130505002331099 is a deficient number, since it is larger than the sum of its proper divisors (12586776876949).
130505002331099 is a wasteful number, since it uses less digits than its factorization.
130505002331099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60223813005.
The product of its (nonzero) digits is 109350, while the sum is 41.
The spelling of 130505002331099 in words is "one hundred thirty trillion, five hundred five billion, two million, three hundred thirty-one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •