Base | Representation |
---|---|
bin | 1101101110110… |
… | …11110100001010 |
3 | 22000202112000220 |
4 | 12313123310022 |
5 | 213442221041 |
6 | 15233010510 |
7 | 2566066623 |
oct | 667336412 |
9 | 260675026 |
10 | 115195146 |
11 | 5a02a900 |
12 | 326b3a36 |
13 | 1ab33c11 |
14 | 11428a4a |
15 | a1a6d66 |
hex | 6ddbd0a |
115195146 has 48 divisors (see below), whose sum is σ = 255909024. Its totient is φ = 34540000.
The previous prime is 115195133. The next prime is 115195147. The reversal of 115195146 is 641591511.
It is a super-2 number, since 2×1151951462 = 26539843323922632, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115195147) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 72541 + ... + 74111.
It is an arithmetic number, because the mean of its divisors is an integer number (5331438).
Almost surely, 2115195146 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115195146, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127954512).
115195146 is an abundant number, since it is smaller than the sum of its proper divisors (140713878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115195146 is a wasteful number, since it uses less digits than its factorization.
115195146 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1699 (or 1688 counting only the distinct ones).
The product of its digits is 5400, while the sum is 33.
The square root of 115195146 is about 10732.9001672428. The cubic root of 115195146 is about 486.5693255201.
The spelling of 115195146 in words is "one hundred fifteen million, one hundred ninety-five thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •