Base | Representation |
---|---|
bin | 11011010001010101… |
… | …10100001010010100 |
3 | 1101210100112121222120 |
4 | 31220222310022110 |
5 | 214441041043202 |
6 | 10420450255540 |
7 | 1025550034032 |
oct | 155052641224 |
9 | 41710477876 |
10 | 14640956052 |
11 | 623348aa88 |
12 | 2a072875b0 |
13 | 14c4347508 |
14 | 9cc681552 |
15 | 5aa5410bc |
hex | 368ab4294 |
14640956052 has 24 divisors (see below), whose sum is σ = 34224699936. Its totient is φ = 4871394528.
The previous prime is 14640956039. The next prime is 14640956059. The reversal of 14640956052 is 25065904641.
It is a junction number, because it is equal to n+sod(n) for n = 14640955995 and 14640956013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14640956059) 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, 1108683 + ... + 1121810.
It is an arithmetic number, because the mean of its divisors is an integer number (1426029164).
Almost surely, 214640956052 is an apocalyptic number.
14640956052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14640956052 is an abundant number, since it is smaller than the sum of its proper divisors (19583743884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14640956052 is a wasteful number, since it uses less digits than its factorization.
14640956052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2231047 (or 2231045 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 14640956052 in words is "fourteen billion, six hundred forty million, nine hundred fifty-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •