Base | Representation |
---|---|
bin | 100010110110100… |
… | …0000101000000000 |
3 | 10000111111001012001 |
4 | 1011231000220000 |
5 | 4343333130234 |
6 | 312012513344 |
7 | 40656652000 |
oct | 10555005000 |
9 | 3014431161 |
10 | 1169426944 |
11 | 550124854 |
12 | 28777b854 |
13 | 15837b70a |
14 | b1452000 |
15 | 6c9ebd14 |
hex | 45b40a00 |
1169426944 has 80 divisors (see below), whose sum is σ = 2725272000. Its totient is φ = 501107712.
The previous prime is 1169426917. The next prime is 1169426977. The reversal of 1169426944 is 4496249611.
It is a junction number, because it is equal to n+sod(n) for n = 1169426894 and 1169426903.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 172287 + ... + 178945.
It is an arithmetic number, because the mean of its divisors is an integer number (34065900).
Almost surely, 21169426944 is an apocalyptic number.
1169426944 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1169426944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1362636000).
1169426944 is an abundant number, since it is smaller than the sum of its proper divisors (1555845056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1169426944 is an frugal number, since it uses more digits than its factorization.
1169426944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6698 (or 6668 counting only the distinct ones).
The product of its digits is 373248, while the sum is 46.
The square root of 1169426944 is about 34196.8850043392. The cubic root of 1169426944 is about 1053.5561792390.
The spelling of 1169426944 in words is "one billion, one hundred sixty-nine million, four hundred twenty-six thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •