Base | Representation |
---|---|
bin | 10011011011000001… |
… | …10101011110010100 |
3 | 222220200201121222100 |
4 | 21231200311132110 |
5 | 132323334240042 |
6 | 4442404202100 |
7 | 516253144230 |
oct | 115540653624 |
9 | 28820647870 |
10 | 10427258772 |
11 | 4470a08937 |
12 | 2030099330 |
13 | ca2384108 |
14 | 70cbc15c0 |
15 | 41065824c |
hex | 26d835794 |
10427258772 has 72 divisors (see below), whose sum is σ = 30153666816. Its totient is φ = 2976202944.
The previous prime is 10427258747. The next prime is 10427258791. The reversal of 10427258772 is 27785272401.
10427258772 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
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 23 ways as a sum of consecutive naturals, for example, 234853 + ... + 275699.
It is an arithmetic number, because the mean of its divisors is an integer number (418800928).
Almost surely, 210427258772 is an apocalyptic number.
10427258772 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10427258772 is an abundant number, since it is smaller than the sum of its proper divisors (19726408044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10427258772 is a wasteful number, since it uses less digits than its factorization.
10427258772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41877 (or 41872 counting only the distinct ones).
The product of its (nonzero) digits is 439040, while the sum is 45.
The spelling of 10427258772 in words is "ten billion, four hundred twenty-seven million, two hundred fifty-eight thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •