Base | Representation |
---|---|
bin | 111100001101101… |
… | …101010001001100 |
3 | 2121101220210220010 |
4 | 330031231101030 |
5 | 4032104220002 |
6 | 244124353220 |
7 | 34014532020 |
oct | 7415552114 |
9 | 2541823803 |
10 | 1010226252 |
11 | 479278a32 |
12 | 2423a5810 |
13 | 1313aaa19 |
14 | 98250380 |
15 | 5da5146c |
hex | 3c36d44c |
1010226252 has 48 divisors (see below), whose sum is σ = 2786837760. Its totient is φ = 278682432.
The previous prime is 1010226247. The next prime is 1010226271. The reversal of 1010226252 is 2526220101.
It is a happy number.
1010226252 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 (21).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 204918 + ... + 209789.
It is an arithmetic number, because the mean of its divisors is an integer number (58059120).
Almost surely, 21010226252 is an apocalyptic number.
1010226252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010226252 is an abundant number, since it is smaller than the sum of its proper divisors (1776611508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010226252 is a wasteful number, since it uses less digits than its factorization.
1010226252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414750 (or 414748 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 1010226252 is about 31784.0565692927. The cubic root of 1010226252 is about 1003.3971966526.
Adding to 1010226252 its reverse (2526220101), we get a palindrome (3536446353).
The spelling of 1010226252 in words is "one billion, ten million, two hundred twenty-six thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •