Base | Representation |
---|---|
bin | 111100100101010101… |
… | …1110100111101111111 |
3 | 110102211000220111111222 |
4 | 1321022223310331333 |
5 | 4112422104201030 |
6 | 135433521503555 |
7 | 12254022640430 |
oct | 1711253647577 |
9 | 412730814458 |
10 | 130102022015 |
11 | 501a3221849 |
12 | 2126aaa1bbb |
13 | c3650757a4 |
14 | 6422c65487 |
15 | 35b6cb73e5 |
hex | 1e4aaf4f7f |
130102022015 has 32 divisors (see below), whose sum is σ = 179264431104. Its totient is φ = 88793832960.
The previous prime is 130102021991. The next prime is 130102022021. The reversal of 130102022015 is 510220201031.
It is a happy number.
It is not a de Polignac number, because 130102022015 - 212 = 130102017919 is a prime.
It is a super-2 number, since 2×1301020220152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130102021984 and 130102022002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22324532 + ... + 22330358.
It is an arithmetic number, because the mean of its divisors is an integer number (5602013472).
Almost surely, 2130102022015 is an apocalyptic number.
130102022015 is a deficient number, since it is larger than the sum of its proper divisors (49162409089).
130102022015 is a wasteful number, since it uses less digits than its factorization.
130102022015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8727.
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 130102022015 its reverse (510220201031), we get a palindrome (640322223046).
The spelling of 130102022015 in words is "one hundred thirty billion, one hundred two million, twenty-two thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •