Base | Representation |
---|---|
bin | 10111111110100001110101… |
… | …010100110110000111011100 |
3 | 111211101010001120102121211001 |
4 | 113332201311110312013130 |
5 | 102310211201343401304 |
6 | 1012135552120440044 |
7 | 31132440666632650 |
oct | 2776416524660734 |
9 | 454333046377731 |
10 | 105452005450204 |
11 | 30666a42a48546 |
12 | b9b137b319024 |
13 | 46ac109c2028a |
14 | 1c07c93564a60 |
15 | c2d0ae36bda4 |
hex | 5fe8755361dc |
105452005450204 has 48 divisors (see below), whose sum is σ = 210987315302400. Its totient is φ = 45175869135936.
The previous prime is 105452005450201. The next prime is 105452005450217. The reversal of 105452005450204 is 402054500254501.
It is a super-2 number, since 2×1054520054502042 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105452005450201) 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, 792156402 + ... + 792289510.
It is an arithmetic number, because the mean of its divisors is an integer number (4395569068800).
Almost surely, 2105452005450204 is an apocalyptic number.
105452005450204 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
105452005450204 is an abundant number, since it is smaller than the sum of its proper divisors (105535309852196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105452005450204 is a wasteful number, since it uses less digits than its factorization.
105452005450204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144082 (or 144080 counting only the distinct ones).
The product of its (nonzero) digits is 160000, while the sum is 37.
The spelling of 105452005450204 in words is "one hundred five trillion, four hundred fifty-two billion, five million, four hundred fifty thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •