Base | Representation |
---|---|
bin | 110001001000100101… |
… | …1110111111100000010 |
3 | 101002100112010121002200 |
4 | 1202101023313330002 |
5 | 3212043321233010 |
6 | 120250053054030 |
7 | 10423521623025 |
oct | 1422113677402 |
9 | 332315117080 |
10 | 105515024130 |
11 | 4082653138a |
12 | 18548927316 |
13 | 9c47283a29 |
14 | 516d6a91bc |
15 | 2b284c5cc0 |
hex | 18912f7f02 |
105515024130 has 48 divisors (see below), whose sum is σ = 277002573120. Its totient is φ = 27864159264.
The previous prime is 105515024123. The next prime is 105515024177. The reversal of 105515024130 is 31420515501.
105515024130 is a `hidden beast` number, since 10 + 5 + 515 + 0 + 2 + 4 + 130 = 666.
It is a super-2 number, since 2×1055150241302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105515024094 and 105515024103.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5681940 + ... + 5700479.
It is an arithmetic number, because the mean of its divisors is an integer number (5770886940).
Almost surely, 2105515024130 is an apocalyptic number.
105515024130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105515024130 is an abundant number, since it is smaller than the sum of its proper divisors (171487548990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105515024130 is a wasteful number, since it uses less digits than its factorization.
105515024130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11382535 (or 11382532 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 105515024130 its reverse (31420515501), we get a palindrome (136935539631).
The spelling of 105515024130 in words is "one hundred five billion, five hundred fifteen million, twenty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •