Base | Representation |
---|---|
bin | 10011000011011111… |
… | …11110001011000000 |
3 | 222101221100202121000 |
4 | 21201233332023000 |
5 | 131422323244333 |
6 | 4411034132000 |
7 | 511335500151 |
oct | 114157761300 |
9 | 28357322530 |
10 | 10229899968 |
11 | 437a56a292 |
12 | 1b95b81000 |
13 | c70513062 |
14 | 6d08c9928 |
15 | 3ed171713 |
hex | 261bfe2c0 |
10229899968 has 112 divisors (see below), whose sum is σ = 30486360160. Its totient is φ = 3363213312.
The previous prime is 10229899949. The next prime is 10229899973. The reversal of 10229899968 is 86999892201.
10229899968 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85596 + ... + 166692.
Almost surely, 210229899968 is an apocalyptic number.
10229899968 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10229899968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15243180080).
10229899968 is an abundant number, since it is smaller than the sum of its proper divisors (20256460192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10229899968 is an equidigital number, since it uses as much as digits as its factorization.
10229899968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81191 (or 81175 counting only the distinct ones).
The product of its (nonzero) digits is 10077696, while the sum is 63.
The spelling of 10229899968 in words is "ten billion, two hundred twenty-nine million, eight hundred ninety-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •