Base | Representation |
---|---|
bin | 10011000000000011… |
… | …01110100100100110 |
3 | 222022220222111121100 |
4 | 21200001232210212 |
5 | 131342424001410 |
6 | 4404122500530 |
7 | 510535033311 |
oct | 114001564446 |
9 | 28286874540 |
10 | 10201000230 |
11 | 4365220503 |
12 | 1b88364746 |
13 | c67534b15 |
14 | 6cab25978 |
15 | 3ea8638c0 |
hex | 26006e926 |
10201000230 has 24 divisors (see below), whose sum is σ = 26522600832. Its totient is φ = 2720266704.
The previous prime is 10201000207. The next prime is 10201000237. The reversal of 10201000230 is 3200010201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201000237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56672134 + ... + 56672313.
It is an arithmetic number, because the mean of its divisors is an integer number (1105108368).
Almost surely, 210201000230 is an apocalyptic number.
10201000230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10201000230 is an abundant number, since it is smaller than the sum of its proper divisors (16321600602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201000230 is a wasteful number, since it uses less digits than its factorization.
10201000230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113344460 (or 113344457 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 10201000230 its reverse (3200010201), we get a palindrome (13401010431).
The spelling of 10201000230 in words is "ten billion, two hundred one million, two hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •