Base | Representation |
---|---|
bin | 100000000110110… |
… | …0010011111100001 |
3 | 2210002010001101211 |
4 | 1000031202133201 |
5 | 4201241302402 |
6 | 254522030121 |
7 | 35460552010 |
oct | 10015423741 |
9 | 2702101354 |
10 | 1077290977 |
11 | 503114724 |
12 | 260948341 |
13 | 14225c4a9 |
14 | a310aa77 |
15 | 6489c4d7 |
hex | 403627e1 |
1077290977 has 16 divisors (see below), whose sum is σ = 1247788800. Its totient is φ = 910990080.
The previous prime is 1077290957. The next prime is 1077290983. The reversal of 1077290977 is 7790927701.
It is a de Polignac number, because none of the positive numbers 2k-1077290977 is a prime.
It is a super-2 number, since 2×10772909772 = 2321111698251229058, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1077290977.
It is not an unprimeable number, because it can be changed into a prime (1077290917) 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 15 ways as a sum of consecutive naturals, for example, 322924 + ... + 326242.
It is an arithmetic number, because the mean of its divisors is an integer number (77986800).
Almost surely, 21077290977 is an apocalyptic number.
It is an amenable number.
1077290977 is a deficient number, since it is larger than the sum of its proper divisors (170497823).
1077290977 is an equidigital number, since it uses as much as digits as its factorization.
1077290977 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3936.
The product of its (nonzero) digits is 388962, while the sum is 49.
The square root of 1077290977 is about 32822.1110990747. Note that the first 3 decimals coincide. The cubic root of 1077290977 is about 1025.1270045283.
The spelling of 1077290977 in words is "one billion, seventy-seven million, two hundred ninety thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •