Base | Representation |
---|---|
bin | 1101001101001100001110… |
… | …0111110110011000010000 |
3 | 1220102010100200110201210020 |
4 | 3103103003213312120100 |
5 | 3400400003443321302 |
6 | 50514304242103440 |
7 | 3026024602003062 |
oct | 323230347663020 |
9 | 56363320421706 |
10 | 14520271463952 |
11 | 4699015775a81 |
12 | 176616164ab80 |
13 | 814342a958b7 |
14 | 382adba3d732 |
15 | 1a2a8b520ebc |
hex | d34c39f6610 |
14520271463952 has 80 divisors (see below), whose sum is σ = 38529259600512. Its totient is φ = 4708695905280.
The previous prime is 14520271463947. The next prime is 14520271463983. The reversal of 14520271463952 is 25936417202541.
It is a junction number, because it is equal to n+sod(n) for n = 14520271463895 and 14520271463904.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14004052 + ... + 15005132.
Almost surely, 214520271463952 is an apocalyptic number.
14520271463952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14520271463952 is an abundant number, since it is smaller than the sum of its proper divisors (24008988136560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14520271463952 is a wasteful number, since it uses less digits than its factorization.
14520271463952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009296 (or 1009290 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 51.
The spelling of 14520271463952 in words is "fourteen trillion, five hundred twenty billion, two hundred seventy-one million, four hundred sixty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •