Base | Representation |
---|---|
bin | 10011100111110010… |
… | …10110111100100110 |
3 | 1000012011020110101110 |
4 | 21303321112330212 |
5 | 133033243210010 |
6 | 4501151405450 |
7 | 522023334336 |
oct | 116371267446 |
9 | 30164213343 |
10 | 10534350630 |
11 | 4516403601 |
12 | 205bb23886 |
13 | cbb60b88b |
14 | 71d0db0c6 |
15 | 419c5e120 |
hex | 273e56f26 |
10534350630 has 64 divisors (see below), whose sum is σ = 26237442240. Its totient is φ = 2703665664.
The previous prime is 10534350613. The next prime is 10534350667. The reversal of 10534350630 is 3605343501.
It is a happy number.
It is a super-2 number, since 2×105343506302 (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, 256692 + ... + 294888.
It is an arithmetic number, because the mean of its divisors is an integer number (409960035).
Almost surely, 210534350630 is an apocalyptic number.
10534350630 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 10534350630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13118721120).
10534350630 is an abundant number, since it is smaller than the sum of its proper divisors (15703091610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10534350630 is a wasteful number, since it uses less digits than its factorization.
10534350630 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38553.
The product of its (nonzero) digits is 16200, while the sum is 30.
The spelling of 10534350630 in words is "ten billion, five hundred thirty-four million, three hundred fifty thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •