Base | Representation |
---|---|
bin | 1101110010101… |
… | …00111101001100 |
3 | 22001200201200110 |
4 | 12321110331030 |
5 | 214104110330 |
6 | 15251400020 |
7 | 2603234352 |
oct | 671247514 |
9 | 261621613 |
10 | 115691340 |
11 | 5a339686 |
12 | 328b3010 |
13 | 1ac78a1b |
14 | 115177d2 |
15 | a253db0 |
hex | 6e54f4c |
115691340 has 96 divisors (see below), whose sum is σ = 335301120. Its totient is φ = 29785600.
The previous prime is 115691309. The next prime is 115691363. The reversal of 115691340 is 43196511.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 115691298 and 115691307.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 322081 + ... + 322439.
It is an arithmetic number, because the mean of its divisors is an integer number (3492720).
Almost surely, 2115691340 is an apocalyptic number.
115691340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115691340, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167650560).
115691340 is an abundant number, since it is smaller than the sum of its proper divisors (219609780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115691340 is a wasteful number, since it uses less digits than its factorization.
115691340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543 (or 541 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 30.
The square root of 115691340 is about 10755.9908888024. The cubic root of 115691340 is about 487.2669444869.
The spelling of 115691340 in words is "one hundred fifteen million, six hundred ninety-one thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •