Base | Representation |
---|---|
bin | 11101010000001011000… |
… | …11001101000111110010 |
3 | 10120002101020001211022102 |
4 | 32220011203031013302 |
5 | 112431434024242010 |
6 | 2045424344340402 |
7 | 132421461314543 |
oct | 16500543150762 |
9 | 3502336054272 |
10 | 1005115462130 |
11 | 3582a352534a |
12 | 14296b174702 |
13 | 73a22022a00 |
14 | 3690d9a24ca |
15 | 1b22a8c8ba5 |
hex | ea058cd1f2 |
1005115462130 has 48 divisors (see below), whose sum is σ = 1962602079624. Its totient is φ = 370452925440.
The previous prime is 1005115462121. The next prime is 1005115462171. The reversal of 1005115462130 is 312645115001.
It can be written as a sum of positive squares in 12 ways, for example, as 204829561561 + 800285900569 = 452581^2 + 894587^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1005115462093 and 1005115462102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 407450 + ... + 1475210.
Almost surely, 21005115462130 is an apocalyptic number.
1005115462130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1005115462130 is a deficient number, since it is larger than the sum of its proper divisors (957486617494).
1005115462130 is a wasteful number, since it uses less digits than its factorization.
1005115462130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1068351 (or 1068338 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 1005115462130 in words is "one trillion, five billion, one hundred fifteen million, four hundred sixty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •