Base | Representation |
---|---|
bin | 11011110110000011… |
… | …11100111011010000 |
3 | 1102120211012110010201 |
4 | 31323001330323100 |
5 | 221103421324102 |
6 | 10511213104544 |
7 | 1036310332615 |
oct | 157301747320 |
9 | 42524173121 |
10 | 14949011152 |
11 | 6381366379 |
12 | 2a92488154 |
13 | 154310583a |
14 | a1b55050c |
15 | 5c75e1987 |
hex | 37b07ced0 |
14949011152 has 10 divisors (see below), whose sum is σ = 28963709138. Its totient is φ = 7474505568.
The previous prime is 14949011117. The next prime is 14949011153. The reversal of 14949011152 is 25111094941.
It can be written as a sum of positive squares in only one way, i.e., 8870625856 + 6078385296 = 94184^2 + 77964^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14949011153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 467156583 + ... + 467156614.
Almost surely, 214949011152 is an apocalyptic number.
It is an amenable number.
14949011152 is a deficient number, since it is larger than the sum of its proper divisors (14014697986).
14949011152 is an equidigital number, since it uses as much as digits as its factorization.
14949011152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 934313205 (or 934313199 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 37.
The spelling of 14949011152 in words is "fourteen billion, nine hundred forty-nine million, eleven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •