Base | Representation |
---|---|
bin | 110101111110001111… |
… | …0010100001001000110 |
3 | 102002011121121202202021 |
4 | 1223330132110021012 |
5 | 3344333132024300 |
6 | 125125045233354 |
7 | 11242142601361 |
oct | 1537436241106 |
9 | 362147552667 |
10 | 115904954950 |
11 | 45178364174 |
12 | 1a56840285a |
13 | ac119985a5 |
14 | 58775310d8 |
15 | 3035708d1a |
hex | 1afc794246 |
115904954950 has 48 divisors (see below), whose sum is σ = 221537186784. Its totient is φ = 45083001600.
The previous prime is 115904954947. The next prime is 115904954981. The reversal of 115904954950 is 59459409511.
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 3370242 + ... + 3404458.
It is an arithmetic number, because the mean of its divisors is an integer number (4615358058).
Almost surely, 2115904954950 is an apocalyptic number.
115904954950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115904954950 is a deficient number, since it is larger than the sum of its proper divisors (105632231834).
115904954950 is a wasteful number, since it uses less digits than its factorization.
115904954950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36097 (or 36092 counting only the distinct ones).
The product of its (nonzero) digits is 1458000, while the sum is 52.
The spelling of 115904954950 in words is "one hundred fifteen billion, nine hundred four million, nine hundred fifty-four thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •