Base | Representation |
---|---|
bin | 11011110110000110… |
… | …00111000001010000 |
3 | 1102120211202212110000 |
4 | 31323003013001100 |
5 | 221104011032030 |
6 | 10511223410000 |
7 | 1036313035461 |
oct | 157303070120 |
9 | 42524685400 |
10 | 14949314640 |
11 | 6381553397 |
12 | 2a925b3900 |
13 | 15431b0a10 |
14 | a1b5ccd68 |
15 | 5c7651860 |
hex | 37b0c7050 |
14949314640 has 400 divisors, whose sum is σ = 57229337088. Its totient is φ = 3593382912.
The previous prime is 14949314621. The next prime is 14949314641. The reversal of 14949314640 is 4641394941.
14949314640 is a `hidden beast` number, since 1 + 494 + 93 + 14 + 64 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14949314641) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3620257 + ... + 3624383.
Almost surely, 214949314640 is an apocalyptic number.
14949314640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14949314640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28614668544).
14949314640 is an abundant number, since it is smaller than the sum of its proper divisors (42280022448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14949314640 is a wasteful number, since it uses less digits than its factorization.
14949314640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4208 (or 4193 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 45.
The spelling of 14949314640 in words is "fourteen billion, nine hundred forty-nine million, three hundred fourteen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •