Base | Representation |
---|---|
bin | 10111111111010101101100… |
… | …001011001000100111110110 |
3 | 111211120102210002010020101102 |
4 | 113333111230023020213312 |
5 | 102312114220220000340 |
6 | 1012221321222330102 |
7 | 31136451553623554 |
oct | 2777255413104766 |
9 | 454512702106342 |
10 | 105507686484470 |
11 | 30688616493736 |
12 | ba0011a889932 |
13 | 46b444194a52a |
14 | 1c0a856594bd4 |
15 | c2e76c841215 |
hex | 5ff56c2c89f6 |
105507686484470 has 8 divisors (see below), whose sum is σ = 189913835672064. Its totient is φ = 42203074593784.
The previous prime is 105507686484457. The next prime is 105507686484509. The reversal of 105507686484470 is 74484686705501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1055076864844702 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105507686484397 and 105507686484406.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5275384324214 + ... + 5275384324233.
It is an arithmetic number, because the mean of its divisors is an integer number (23739229459008).
Almost surely, 2105507686484470 is an apocalyptic number.
105507686484470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105507686484470 is a deficient number, since it is larger than the sum of its proper divisors (84406149187594).
105507686484470 is a wasteful number, since it uses less digits than its factorization.
105507686484470 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10550768648454.
The product of its (nonzero) digits is 180633600, while the sum is 65.
The spelling of 105507686484470 in words is "one hundred five trillion, five hundred seven billion, six hundred eighty-six million, four hundred eighty-four thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •