Base | Representation |
---|---|
bin | 11010100011001101… |
… | …10110001111110100 |
3 | 1100210101111021000100 |
4 | 31101212312033310 |
5 | 213143013240202 |
6 | 10314225314100 |
7 | 1013141225040 |
oct | 152146661764 |
9 | 40711437010 |
10 | 14254040052 |
11 | 605504129a |
12 | 2919795930 |
13 | 1462137435 |
14 | 993125020 |
15 | 5865b441c |
hex | 3519b63f4 |
14254040052 has 36 divisors (see below), whose sum is σ = 41178338656. Its totient is φ = 4072582800.
The previous prime is 14254040023. The next prime is 14254040063. The reversal of 14254040052 is 25004045241.
14254040052 is a `hidden beast` number, since 1 + 4 + 254 + 0 + 400 + 5 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 14254039998 and 14254040025.
It is a congruent number.
It is an unprimeable number.
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 in 11 ways as a sum of consecutive naturals, for example, 28281574 + ... + 28282077.
Almost surely, 214254040052 is an apocalyptic number.
14254040052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14254040052 is an abundant number, since it is smaller than the sum of its proper divisors (26924298604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14254040052 is a wasteful number, since it uses less digits than its factorization.
14254040052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56563668 (or 56563663 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 27.
Adding to 14254040052 its reverse (25004045241), we get a palindrome (39258085293).
The spelling of 14254040052 in words is "fourteen billion, two hundred fifty-four million, forty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •