Base | Representation |
---|---|
bin | 10011010011010011… |
… | …00000111100101010 |
3 | 222202011201201221100 |
4 | 21221221200330222 |
5 | 132210240101010 |
6 | 4432130422230 |
7 | 514535105661 |
oct | 115151407452 |
9 | 28664651840 |
10 | 10362425130 |
11 | 4438356412 |
12 | 2012431976 |
13 | c91b04005 |
14 | 704345dd8 |
15 | 409aed2c0 |
hex | 269a60f2a |
10362425130 has 24 divisors (see below), whose sum is σ = 26942305572. Its totient is φ = 2763313344.
The previous prime is 10362425093. The next prime is 10362425131. The reversal of 10362425130 is 3152426301.
10362425130 is a `hidden beast` number, since 1 + 0 + 3 + 624 + 2 + 5 + 1 + 30 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 9996200361 + 366224769 = 99981^2 + 19137^2 .
It is a super-3 number, since 3×103624251303 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10362425094 and 10362425103.
It is not an unprimeable number, because it can be changed into a prime (10362425131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 57568939 + ... + 57569118.
Almost surely, 210362425130 is an apocalyptic number.
10362425130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10362425130 is an abundant number, since it is smaller than the sum of its proper divisors (16579880442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10362425130 is a wasteful number, since it uses less digits than its factorization.
10362425130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115138070 (or 115138067 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The spelling of 10362425130 in words is "ten billion, three hundred sixty-two million, four hundred twenty-five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •