Base | Representation |
---|---|
bin | 110101100011110000… |
… | …0010101000000000000 |
3 | 101222212200102221000212 |
4 | 1223013200111000000 |
5 | 3341023132242204 |
6 | 124500542133252 |
7 | 11211132223346 |
oct | 1530740250000 |
9 | 358780387025 |
10 | 115016290304 |
11 | 44861774283 |
12 | 1a35a881228 |
13 | aacc840516 |
14 | 57d14c5996 |
15 | 2ed26bac6e |
hex | 1ac7815000 |
115016290304 has 156 divisors (see below), whose sum is σ = 240827489916. Its totient is φ = 54918119424.
The previous prime is 115016290231. The next prime is 115016290313. The reversal of 115016290304 is 403092610511.
It can be written as a sum of positive squares in 6 ways, for example, as 1905147904 + 113111142400 = 43648^2 + 336320^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 595939232 + ... + 595939424.
It is an arithmetic number, because the mean of its divisors is an integer number (1543765961).
Almost surely, 2115016290304 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115016290304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120413744958).
115016290304 is an abundant number, since it is smaller than the sum of its proper divisors (125811199612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115016290304 is an equidigital number, since it uses as much as digits as its factorization.
115016290304 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 448 (or 397 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 32.
The spelling of 115016290304 in words is "one hundred fifteen billion, sixteen million, two hundred ninety thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •