Base | Representation |
---|---|
bin | 10011000110010111… |
… | …11101101010001000 |
3 | 222110121201221100111 |
4 | 21203023331222020 |
5 | 132000011440422 |
6 | 4413255044104 |
7 | 512050455535 |
oct | 114313755210 |
9 | 28417657314 |
10 | 10254015112 |
11 | 4392140360 |
12 | 1ba2070634 |
13 | c75507583 |
14 | 6d3ba5d8c |
15 | 400336a77 |
hex | 2632fda88 |
10254015112 has 128 divisors (see below), whose sum is σ = 22886841600. Its totient is φ = 4257792000.
The previous prime is 10254015059. The next prime is 10254015139. The reversal of 10254015112 is 21151045201.
10254015112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
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 31 ways as a sum of consecutive naturals, for example, 5692612 + ... + 5694412.
It is an arithmetic number, because the mean of its divisors is an integer number (178803450).
Almost surely, 210254015112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10254015112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11443420800).
10254015112 is an abundant number, since it is smaller than the sum of its proper divisors (12632826488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10254015112 is a wasteful number, since it uses less digits than its factorization.
10254015112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1967 (or 1963 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 22.
The spelling of 10254015112 in words is "ten billion, two hundred fifty-four million, fifteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •