Base | Representation |
---|---|
bin | 111011101010111… |
… | …000010100011000 |
3 | 2120202201222012010 |
4 | 323222320110120 |
5 | 4022240041342 |
6 | 243200545520 |
7 | 33544115415 |
oct | 7352702430 |
9 | 2522658163 |
10 | 1001096472 |
11 | 474102662 |
12 | 23b3222a0 |
13 | 12c53229c |
14 | 96d5510c |
15 | 5cd4b29c |
hex | 3bab8518 |
1001096472 has 64 divisors (see below), whose sum is σ = 2725344000. Its totient is φ = 305230464.
The previous prime is 1001096441. The next prime is 1001096479. The reversal of 1001096472 is 2746901001.
It is a happy number.
1001096472 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001096479) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24628 + ... + 51075.
It is an arithmetic number, because the mean of its divisors is an integer number (42583500).
Almost surely, 21001096472 is an apocalyptic number.
1001096472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1001096472 is an abundant number, since it is smaller than the sum of its proper divisors (1724247528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001096472 is a wasteful number, since it uses less digits than its factorization.
1001096472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75760 (or 75756 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 30.
The square root of 1001096472 is about 31640.1085965267. The cubic root of 1001096472 is about 1000.3653571646.
Adding to 1001096472 its reverse (2746901001), we get a palindrome (3747997473).
The spelling of 1001096472 in words is "one billion, one million, ninety-six thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •