Base | Representation |
---|---|
bin | 10011101100100100… |
… | …00000100101110010 |
3 | 1000021221112111122120 |
4 | 21312102000211302 |
5 | 133124014221330 |
6 | 4505141215110 |
7 | 523020431400 |
oct | 116622004562 |
9 | 30257474576 |
10 | 10574367090 |
11 | 4536a55561 |
12 | 2071401496 |
13 | cc69aca61 |
14 | 724556470 |
15 | 41d515c10 |
hex | 276480972 |
10574367090 has 96 divisors (see below), whose sum is σ = 29580712704. Its totient is φ = 2412184320.
The previous prime is 10574367049. The next prime is 10574367109. The reversal of 10574367090 is 9076347501.
It is a super-2 number, since 2×105743670902 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 758967 + ... + 772773.
It is an arithmetic number, because the mean of its divisors is an integer number (308132424).
Almost surely, 210574367090 is an apocalyptic number.
10574367090 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10574367090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14790356352).
10574367090 is an abundant number, since it is smaller than the sum of its proper divisors (19006345614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10574367090 is a wasteful number, since it uses less digits than its factorization.
10574367090 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14352 (or 14345 counting only the distinct ones).
The product of its (nonzero) digits is 158760, while the sum is 42.
The spelling of 10574367090 in words is "ten billion, five hundred seventy-four million, three hundred sixty-seven thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •