Base | Representation |
---|---|
bin | 110101100111101111… |
… | …0110001101000001000 |
3 | 102000020000020012210120 |
4 | 1223033132301220020 |
5 | 3341311411213000 |
6 | 124522122143240 |
7 | 11214345465114 |
oct | 1531736615010 |
9 | 360200205716 |
10 | 115150101000 |
11 | 44920259230 |
12 | 1a397651b20 |
13 | ab2149164c |
14 | 5805198744 |
15 | 2ede2ed6a0 |
hex | 1acf7b1a08 |
115150101000 has 128 divisors (see below), whose sum is σ = 391929183360. Its totient is φ = 27915168000.
The previous prime is 115150100987. The next prime is 115150101019. The reversal of 115150101000 is 101051511.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1711699 + ... + 1777698.
It is an arithmetic number, because the mean of its divisors is an integer number (3061946745).
Almost surely, 2115150101000 is an apocalyptic number.
115150101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115150101000 is an abundant number, since it is smaller than the sum of its proper divisors (276779082360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115150101000 is a wasteful number, since it uses less digits than its factorization.
115150101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3489432 (or 3489418 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 115150101000 its reverse (101051511), we get a palindrome (115251152511).
The spelling of 115150101000 in words is "one hundred fifteen billion, one hundred fifty million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •