Base | Representation |
---|---|
bin | 10111111000100111001010… |
… | …101011011100011010000101 |
3 | 111202221020120121210100120212 |
4 | 113320213022223130122011 |
5 | 102232031002334410303 |
6 | 1011225110412005205 |
7 | 31061165215515506 |
oct | 2770471253343205 |
9 | 452836517710525 |
10 | 105045415544453 |
11 | 3051a56860144a |
12 | b946609160805 |
13 | 467c981243027 |
14 | 1bd23220b6bad |
15 | c22714163ad8 |
hex | 5f89caadc685 |
105045415544453 has 8 divisors (see below), whose sum is σ = 110574393090720. Its totient is φ = 99516465144720.
The previous prime is 105045415544431. The next prime is 105045415544473. The reversal of 105045415544453 is 354445514540501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105045415544453 - 26 = 105045415544389 is a prime.
It is a super-2 number, since 2×1050454155444532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105045415544473) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1410026 + ... + 14562932.
It is an arithmetic number, because the mean of its divisors is an integer number (13821799136340).
Almost surely, 2105045415544453 is an apocalyptic number.
It is an amenable number.
105045415544453 is a deficient number, since it is larger than the sum of its proper divisors (5528977546267).
105045415544453 is a wasteful number, since it uses less digits than its factorization.
105045415544453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13573267.
The product of its (nonzero) digits is 9600000, while the sum is 50.
The spelling of 105045415544453 in words is "one hundred five trillion, forty-five billion, four hundred fifteen million, five hundred forty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •