Base | Representation |
---|---|
bin | 11101101000001010010101… |
… | …101111001110111001010010 |
3 | 122002100212102010202222101102 |
4 | 131220022111233032321102 |
5 | 114034342003340404020 |
6 | 1141044251045304402 |
7 | 36306045340245515 |
oct | 3550122557167122 |
9 | 562325363688342 |
10 | 130303230013010 |
11 | 3857832038706a |
12 | 12745780105102 |
13 | 57927076304a2 |
14 | 24269d229cd7c |
15 | 100e7455d3475 |
hex | 768295bcee52 |
130303230013010 has 8 divisors (see below), whose sum is σ = 234545814023436. Its totient is φ = 52121292005200.
The previous prime is 130303230012941. The next prime is 130303230013063. The reversal of 130303230013010 is 10310032303031.
It can be written as a sum of positive squares in 2 ways, for example, as 108842460352081 + 21460769660929 = 10432759^2 + 4632577^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6515161500641 + ... + 6515161500660.
Almost surely, 2130303230013010 is an apocalyptic number.
130303230013010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130303230013010 is a deficient number, since it is larger than the sum of its proper divisors (104242584010426).
130303230013010 is a wasteful number, since it uses less digits than its factorization.
130303230013010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13030323001308.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 130303230013010 its reverse (10310032303031), we get a palindrome (140613262316041).
The spelling of 130303230013010 in words is "one hundred thirty trillion, three hundred three billion, two hundred thirty million, thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •