Base | Representation |
---|---|
bin | 10010101110100111… |
… | …10001100101101000 |
3 | 221221201202112010020 |
4 | 21113103301211220 |
5 | 131043003024412 |
6 | 4341415520440 |
7 | 504110563542 |
oct | 112723614550 |
9 | 27851675106 |
10 | 10054736232 |
11 | 429a700172 |
12 | 1b47389120 |
13 | c43143588 |
14 | 6b5530692 |
15 | 3dcac118c |
hex | 2574f1968 |
10054736232 has 32 divisors (see below), whose sum is σ = 25146962880. Its totient is φ = 3350229120.
The previous prime is 10054736221. The next prime is 10054736233. The reversal of 10054736232 is 23263745001.
10054736232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10054736193 and 10054736202.
It is not an unprimeable number, because it can be changed into a prime (10054736233) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 22588 + ... + 143595.
It is an arithmetic number, because the mean of its divisors is an integer number (785842590).
Almost surely, 210054736232 is an apocalyptic number.
10054736232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10054736232 is an abundant number, since it is smaller than the sum of its proper divisors (15092226648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10054736232 is a wasteful number, since it uses less digits than its factorization.
10054736232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168713 (or 168709 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 33.
The spelling of 10054736232 in words is "ten billion, fifty-four million, seven hundred thirty-six thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •