Base | Representation |
---|---|
bin | 11101100111100100111000… |
… | …001100001010010100111110 |
3 | 122002020000120211212220001110 |
4 | 131213210320030022110332 |
5 | 114033212113443120020 |
6 | 1141013555421422450 |
7 | 36303122501330325 |
oct | 3547447014122476 |
9 | 562200524786043 |
10 | 130263005832510 |
11 | 3856225992a991 |
12 | 12739a1510aa26 |
13 | 578b996ca8755 |
14 | 2424a980170bc |
15 | 100d68e0b78e0 |
hex | 76793830a53e |
130263005832510 has 32 divisors (see below), whose sum is σ = 322716091871232. Its totient is φ = 33616259569440.
The previous prime is 130263005832461. The next prime is 130263005832511. The reversal of 130263005832510 is 15238500362031.
130263005832510 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130263005832511) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70033873174 + ... + 70033875033.
It is an arithmetic number, because the mean of its divisors is an integer number (10084877870976).
Almost surely, 2130263005832510 is an apocalyptic number.
130263005832510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130263005832510 is an abundant number, since it is smaller than the sum of its proper divisors (192453086038722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130263005832510 is a wasteful number, since it uses less digits than its factorization.
130263005832510 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140067748248.
The product of its (nonzero) digits is 129600, while the sum is 39.
The spelling of 130263005832510 in words is "one hundred thirty trillion, two hundred sixty-three billion, five million, eight hundred thirty-two thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •