Base | Representation |
---|---|
bin | 10010111001011100… |
… | …00110001001001010 |
3 | 222012001120221010100 |
4 | 21130232012021022 |
5 | 131234223203000 |
6 | 4354421430230 |
7 | 506262342033 |
oct | 113456061112 |
9 | 28161527110 |
10 | 10145522250 |
11 | 4336979036 |
12 | 1b7186b376 |
13 | c58bac206 |
14 | 6c3603a8a |
15 | 3e5a55a00 |
hex | 25cb8624a |
10145522250 has 96 divisors (see below), whose sum is σ = 27467751168. Its totient is φ = 2702095200.
The previous prime is 10145522237. The next prime is 10145522251. The reversal of 10145522250 is 5222554101.
10145522250 is a `hidden beast` number, since 101 + 4 + 552 + 2 + 2 + 5 + 0 = 666.
It is not an unprimeable number, because it can be changed into a prime (10145522251) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2173419 + ... + 2178081.
It is an arithmetic number, because the mean of its divisors is an integer number (286122408).
Almost surely, 210145522250 is an apocalyptic number.
10145522250 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 10145522250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13733875584).
10145522250 is an abundant number, since it is smaller than the sum of its proper divisors (17322228918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10145522250 is a wasteful number, since it uses less digits than its factorization.
10145522250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5653 (or 5640 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The spelling of 10145522250 in words is "ten billion, one hundred forty-five million, five hundred twenty-two thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •