Base | Representation |
---|---|
bin | 111100100101010110… |
… | …1010100011100101101 |
3 | 110102211001122100222122 |
4 | 1321022231110130231 |
5 | 4112422204204401 |
6 | 135433534122325 |
7 | 12254026156553 |
oct | 1711255243455 |
9 | 412731570878 |
10 | 130102413101 |
11 | 501a3469661 |
12 | 2126b0503a5 |
13 | c3651817bb |
14 | 6422d27bd3 |
15 | 35b6d4321b |
hex | 1e4ab5472d |
130102413101 has 16 divisors (see below), whose sum is σ = 132435838704. Its totient is φ = 127784853504.
The previous prime is 130102413071. The next prime is 130102413107. The reversal of 130102413101 is 101314201031.
It can be written as a sum of positive squares in 8 ways, for example, as 106110601 + 129996302500 = 10301^2 + 360550^2 .
It is a cyclic number.
It is not a de Polignac number, because 130102413101 - 222 = 130098218797 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130102413101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130102413107) 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, 24032471 + ... + 24037883.
It is an arithmetic number, because the mean of its divisors is an integer number (8277239919).
Almost surely, 2130102413101 is an apocalyptic number.
It is an amenable number.
130102413101 is a deficient number, since it is larger than the sum of its proper divisors (2333425603).
130102413101 is an equidigital number, since it uses as much as digits as its factorization.
130102413101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6800.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 130102413101 its reverse (101314201031), we get a palindrome (231416614132).
The spelling of 130102413101 in words is "one hundred thirty billion, one hundred two million, four hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •