Base | Representation |
---|---|
bin | 110011010011001110001110… |
… | …0011110000011011011101000 |
3 | 2012011201101002111201011222222 |
4 | 1212212130130132003123220 |
5 | 433121124344411110242 |
6 | 4235414000110133212 |
7 | 164022126642606422 |
oct | 14646343436033350 |
9 | 2164641074634888 |
10 | 451242626660072 |
11 | 120863a17973465 |
12 | 42739a167b1208 |
13 | 164a2cc68568c0 |
14 | 7d6038c729812 |
15 | 3727cc9d5a5d2 |
hex | 19a671c7836e8 |
451242626660072 has 64 divisors (see below), whose sum is σ = 931821701025600. Its totient is φ = 203591295198720.
The previous prime is 451242626660071. The next prime is 451242626660141. The reversal of 451242626660072 is 270066626242154.
It is a super-2 number, since 2×4512426266600722 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 451242626659996 and 451242626660023.
It is not an unprimeable number, because it can be changed into a prime (451242626660071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 246259997 + ... + 248085612.
It is an arithmetic number, because the mean of its divisors is an integer number (14559714078525).
Almost surely, 2451242626660072 is an apocalyptic number.
It is an amenable number.
451242626660072 is an abundant number, since it is smaller than the sum of its proper divisors (480579074365528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
451242626660072 is a wasteful number, since it uses less digits than its factorization.
451242626660072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494345826 (or 494345822 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 53.
The spelling of 451242626660072 in words is "four hundred fifty-one trillion, two hundred forty-two billion, six hundred twenty-six million, six hundred sixty thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •