Base | Representation |
---|---|
bin | 110101100100111010… |
… | …1100001100101101000 |
3 | 101222222102000222021000 |
4 | 1223021311201211220 |
5 | 3341113140320240 |
6 | 124504500315000 |
7 | 11212115526546 |
oct | 1531165414550 |
9 | 358872028230 |
10 | 115055401320 |
11 | 44881857a32 |
12 | 1a36b9a2a60 |
13 | ab07985532 |
14 | 57d6786d96 |
15 | 2ed5d44430 |
hex | 1ac9d61968 |
115055401320 has 128 divisors (see below), whose sum is σ = 389805408000. Its totient is φ = 30178448640.
The previous prime is 115055401309. The next prime is 115055401327. The reversal of 115055401320 is 23104550511.
115055401320 is a `hidden beast` number, since 115 + 0 + 5 + 540 + 1 + 3 + 2 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (115055401327) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 807340 + ... + 939099.
It is an arithmetic number, because the mean of its divisors is an integer number (3045354750).
Almost surely, 2115055401320 is an apocalyptic number.
115055401320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115055401320 is an abundant number, since it is smaller than the sum of its proper divisors (274750006680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115055401320 is a wasteful number, since it uses less digits than its factorization.
115055401320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1746520 (or 1746510 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 115055401320 its reverse (23104550511), we get a palindrome (138159951831).
The spelling of 115055401320 in words is "one hundred fifteen billion, fifty-five million, four hundred one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •