Base | Representation |
---|---|
bin | 10101000111110111101… |
… | …011000000110011111100 |
3 | 12010202201122202212220210 |
4 | 111013313223000303330 |
5 | 142240243130222440 |
6 | 3030500451512420 |
7 | 206604663564006 |
oct | 25076753006374 |
9 | 5122648685823 |
10 | 1451559226620 |
11 | 50a66a383388 |
12 | 1b53a42b8710 |
13 | a6b5c704aa9 |
14 | 50382059376 |
15 | 27b5984ca80 |
hex | 151f7ac0cfc |
1451559226620 has 48 divisors (see below), whose sum is σ = 4303446180768. Its totient is φ = 364312903680.
The previous prime is 1451559226609. The next prime is 1451559226633. The reversal of 1451559226620 is 266229551541.
It is a self number, because there is not a number n which added to its sum of digits gives 1451559226620.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 711547621 + ... + 711549660.
It is an arithmetic number, because the mean of its divisors is an integer number (89655128766).
Almost surely, 21451559226620 is an apocalyptic number.
1451559226620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1451559226620 is an abundant number, since it is smaller than the sum of its proper divisors (2851886954148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451559226620 is a wasteful number, since it uses less digits than its factorization.
1451559226620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1423097310 (or 1423097308 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 48.
The spelling of 1451559226620 in words is "one trillion, four hundred fifty-one billion, five hundred fifty-nine million, two hundred twenty-six thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •