Base | Representation |
---|---|
bin | 100010101110000… |
… | …0000010110101110 |
3 | 10000012002120120110 |
4 | 1011130000112232 |
5 | 4341213010030 |
6 | 311333200450 |
7 | 40604035134 |
oct | 10534002656 |
9 | 3005076513 |
10 | 1164969390 |
11 | 54865a822 |
12 | 286190126 |
13 | 15747a800 |
14 | b0a11754 |
15 | 6c41b1b0 |
hex | 457005ae |
1164969390 has 48 divisors (see below), whose sum is σ = 3027554928. Its totient is φ = 286760448.
The previous prime is 1164969341. The next prime is 1164969397. The reversal of 1164969390 is 939694611.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1164969397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 109819 + ... + 119958.
It is an arithmetic number, because the mean of its divisors is an integer number (63074061).
Almost surely, 21164969390 is an apocalyptic number.
1164969390 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1164969390 is an abundant number, since it is smaller than the sum of its proper divisors (1862585538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1164969390 is a wasteful number, since it uses less digits than its factorization.
1164969390 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229813 (or 229800 counting only the distinct ones).
The product of its (nonzero) digits is 314928, while the sum is 48.
The square root of 1164969390 is about 34131.6479238844. The cubic root of 1164969390 is about 1052.2158466198.
The spelling of 1164969390 in words is "one billion, one hundred sixty-four million, nine hundred sixty-nine thousand, three hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •