Base | Representation |
---|---|
bin | 10011010010010100… |
… | …01110111111100000 |
3 | 222201121022010122021 |
4 | 21221022032333200 |
5 | 132201140200440 |
6 | 4431234551224 |
7 | 514405314151 |
oct | 115112167740 |
9 | 28647263567 |
10 | 10354225120 |
11 | 4433765648 |
12 | 200b738514 |
13 | c901c2835 |
14 | 70320d928 |
15 | 40902d84a |
hex | 26928efe0 |
10354225120 has 48 divisors (see below), whose sum is σ = 24471499248. Its totient is φ = 4140057600.
The previous prime is 10354225117. The next prime is 10354225171. The reversal of 10354225120 is 2152245301.
10354225120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×103542251203 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 445795 + ... + 468445.
It is an arithmetic number, because the mean of its divisors is an integer number (509822901).
Almost surely, 210354225120 is an apocalyptic number.
10354225120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10354225120 is an abundant number, since it is smaller than the sum of its proper divisors (14117274128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10354225120 is a wasteful number, since it uses less digits than its factorization.
10354225120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25523 (or 25515 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The spelling of 10354225120 in words is "ten billion, three hundred fifty-four million, two hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •