Base | Representation |
---|---|
bin | 110101101110110010… |
… | …0110110001001100000 |
3 | 102000211111012020221220 |
4 | 1223131210312021200 |
5 | 3342302430322113 |
6 | 125001410415040 |
7 | 11223246456051 |
oct | 1533544661140 |
9 | 360744166856 |
10 | 115386573408 |
11 | 44a31792477 |
12 | 1a442891480 |
13 | ab5b478952 |
14 | 5828752728 |
15 | 3004e5e523 |
hex | 1add936260 |
115386573408 has 24 divisors (see below), whose sum is σ = 302889755448. Its totient is φ = 38462191104.
The previous prime is 115386573389. The next prime is 115386573409. The reversal of 115386573408 is 804375683511.
115386573408 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×1153865734082 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115386573409) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 600971641 + ... + 600971832.
It is an arithmetic number, because the mean of its divisors is an integer number (12620406477).
Almost surely, 2115386573408 is an apocalyptic number.
It is an amenable number.
115386573408 is an abundant number, since it is smaller than the sum of its proper divisors (187503182040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115386573408 is a wasteful number, since it uses less digits than its factorization.
115386573408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1201943486 (or 1201943478 counting only the distinct ones).
The product of its (nonzero) digits is 2419200, while the sum is 51.
The spelling of 115386573408 in words is "one hundred fifteen billion, three hundred eighty-six million, five hundred seventy-three thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •