Base | Representation |
---|---|
bin | 11011110110000011… |
… | …11100111011011001 |
3 | 1102120211012110011001 |
4 | 31323001330323121 |
5 | 221103421324121 |
6 | 10511213105001 |
7 | 1036310332630 |
oct | 157301747331 |
9 | 42524173131 |
10 | 14949011161 |
11 | 6381366387 |
12 | 2a92488161 |
13 | 1543105846 |
14 | a1b550517 |
15 | 5c75e1991 |
hex | 37b07ced9 |
14949011161 has 8 divisors (see below), whose sum is σ = 17827392384. Its totient is φ = 12256332000.
The previous prime is 14949011153. The next prime is 14949011167. The reversal of 14949011161 is 16111094941.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14949011161 - 23 = 14949011153 is a prime.
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 14949011161.
It is not an unprimeable number, because it can be changed into a prime (14949011167) 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, 46425340 + ... + 46425661.
It is an arithmetic number, because the mean of its divisors is an integer number (2228424048).
Almost surely, 214949011161 is an apocalyptic number.
It is an amenable number.
14949011161 is a deficient number, since it is larger than the sum of its proper divisors (2878381223).
14949011161 is an equidigital number, since it uses as much as digits as its factorization.
14949011161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92851031.
The product of its (nonzero) digits is 7776, while the sum is 37.
The spelling of 14949011161 in words is "fourteen billion, nine hundred forty-nine million, eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •