Base | Representation |
---|---|
bin | 11010100000001100… |
… | …00100011000000000 |
3 | 1100201121202022210000 |
4 | 31100012010120000 |
5 | 213120014414302 |
6 | 10311521440000 |
7 | 1012412461530 |
oct | 152006043000 |
9 | 40647668700 |
10 | 14228669952 |
11 | 6041793372 |
12 | 29111a0000 |
13 | 1459ac3943 |
14 | 98d9dd4c0 |
15 | 58425231c |
hex | 350184600 |
14228669952 has 400 divisors, whose sum is σ = 50669828352. Its totient is φ = 3886755840.
The previous prime is 14228669927. The next prime is 14228669953. The reversal of 14228669952 is 25996682241.
14228669952 is a `hidden beast` number, since 1 + 422 + 86 + 6 + 99 + 52 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14228669953) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 6675927 + ... + 6678057.
Almost surely, 214228669952 is an apocalyptic number.
14228669952 is a gapful number since it is divisible by the number (12) 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 14228669952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25334914176).
14228669952 is an abundant number, since it is smaller than the sum of its proper divisors (36441158400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14228669952 is an equidigital number, since it uses as much as digits as its factorization.
14228669952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2191 (or 2166 counting only the distinct ones).
The product of its digits is 3732480, while the sum is 54.
The spelling of 14228669952 in words is "fourteen billion, two hundred twenty-eight million, six hundred sixty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •