Base | Representation |
---|---|
bin | 10010111000001100… |
… | …10100111111000000 |
3 | 222011022222021202100 |
4 | 21130012110333000 |
5 | 131224041103110 |
6 | 4353410150400 |
7 | 506104622400 |
oct | 113406247700 |
9 | 28138867670 |
10 | 10135097280 |
11 | 4330aa8660 |
12 | 1b6a282400 |
13 | c5699c0a9 |
14 | 6c208c800 |
15 | 3e4b96bc0 |
hex | 25c194fc0 |
10135097280 has 504 divisors, whose sum is σ = 44245347120. Its totient is φ = 2105671680.
The previous prime is 10135097267. The next prime is 10135097321. The reversal of 10135097280 is 8279053101.
10135097280 is a `hidden beast` number, since 1 + 0 + 1 + 3 + 509 + 72 + 80 = 666.
It is a tau number, because it is divible by the number of its divisors (504).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1549056 + ... + 1555584.
Almost surely, 210135097280 is an apocalyptic number.
10135097280 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10135097280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22122673560).
10135097280 is an abundant number, since it is smaller than the sum of its proper divisors (34110249840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10135097280 is a wasteful number, since it uses less digits than its factorization.
10135097280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6577 (or 6557 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The spelling of 10135097280 in words is "ten billion, one hundred thirty-five million, ninety-seven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •