Base | Representation |
---|---|
bin | 11010100110110000100… |
… | …00110111011001110001 |
3 | 10020101121110220001020010 |
4 | 31103120100313121301 |
5 | 104434200302213031 |
6 | 1535543202405133 |
7 | 123021525256515 |
oct | 15233020673161 |
9 | 3211543801203 |
10 | 914161366641 |
11 | 32276a294196 |
12 | 1292069607a9 |
13 | 682886467b3 |
14 | 323620a6145 |
15 | 18ba58d7246 |
hex | d4d8437671 |
914161366641 has 8 divisors (see below), whose sum is σ = 1283033497120. Its totient is φ = 577365073632.
The previous prime is 914161366549. The next prime is 914161366733. The reversal of 914161366641 is 146663161419.
914161366641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (914161366549) and next prime (914161366733).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 914161366641 - 211 = 914161364593 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (914161326641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8018959300 + ... + 8018959413.
It is an arithmetic number, because the mean of its divisors is an integer number (160379187140).
Almost surely, 2914161366641 is an apocalyptic number.
It is an amenable number.
914161366641 is a deficient number, since it is larger than the sum of its proper divisors (368872130479).
914161366641 is a wasteful number, since it uses less digits than its factorization.
914161366641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16037918735.
The product of its digits is 559872, while the sum is 48.
The spelling of 914161366641 in words is "nine hundred fourteen billion, one hundred sixty-one million, three hundred sixty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •