Base | Representation |
---|---|
bin | 1101001111100001101… |
… | …01011110111111010000 |
3 | 1121111110120120112121110 |
4 | 12213300311132333100 |
5 | 24423331100242410 |
6 | 545010224453320 |
7 | 44605424123043 |
oct | 6476065367720 |
9 | 1544416515543 |
10 | 455012118480 |
11 | 165a7352a227 |
12 | 7422677a240 |
13 | 33ba48c083a |
14 | 1804642ac5a |
15 | bc812da720 |
hex | 69f0d5efd0 |
455012118480 has 160 divisors (see below), whose sum is σ = 1427918928768. Its totient is φ = 119847168000.
The previous prime is 455012118467. The next prime is 455012118481. The reversal of 455012118480 is 84811210554.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (455012118481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10182747 + ... + 10227333.
Almost surely, 2455012118480 is an apocalyptic number.
455012118480 is a gapful number since it is divisible by the number (40) 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 455012118480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (713959464384).
455012118480 is an abundant number, since it is smaller than the sum of its proper divisors (972906810288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
455012118480 is a wasteful number, since it uses less digits than its factorization.
455012118480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45125 (or 45119 counting only the distinct ones).
The product of its (nonzero) digits is 51200, while the sum is 39.
The spelling of 455012118480 in words is "four hundred fifty-five billion, twelve million, one hundred eighteen thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •