Base | Representation |
---|---|
bin | 10011101100011011… |
… | …10011000010110110 |
3 | 1000021212110102011110 |
4 | 21312031303002312 |
5 | 133123223404110 |
6 | 4505101415450 |
7 | 523005152511 |
oct | 116615630266 |
9 | 30255412143 |
10 | 10573263030 |
11 | 4536371010 |
12 | 2070b6a586 |
13 | cc66b4375 |
14 | 724349d78 |
15 | 41d398a20 |
hex | 2763730b6 |
10573263030 has 64 divisors (see below), whose sum is σ = 27744768000. Its totient is φ = 2557470720.
The previous prime is 10573262993. The next prime is 10573263049. The reversal of 10573263030 is 3036237501.
It is a super-2 number, since 2×105732630302 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 112491 + ... + 183849.
It is an arithmetic number, because the mean of its divisors is an integer number (433512000).
Almost surely, 210573263030 is an apocalyptic number.
10573263030 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 10573263030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13872384000).
10573263030 is an abundant number, since it is smaller than the sum of its proper divisors (17171504970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10573263030 is a wasteful number, since it uses less digits than its factorization.
10573263030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71829.
The product of its (nonzero) digits is 11340, while the sum is 30.
The spelling of 10573263030 in words is "ten billion, five hundred seventy-three million, two hundred sixty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •