Base | Representation |
---|---|
bin | 11010001100100001111111… |
… | …100010100011111001000000 |
3 | 120002221000000212012202100122 |
4 | 122030201333202203321000 |
5 | 110100101240140423430 |
6 | 1045010522314235412 |
7 | 33160446455246531 |
oct | 3214417742437100 |
9 | 502830025182318 |
10 | 115210342514240 |
11 | 33789482904986 |
12 | 10b08652725b68 |
13 | 4c3939a306bac |
14 | 20642d320a688 |
15 | d4bd43371ee5 |
hex | 68c87f8a3e40 |
115210342514240 has 56 divisors (see below), whose sum is σ = 274481051638272. Its totient is φ = 46061220718080.
The previous prime is 115210342514221. The next prime is 115210342514249. The reversal of 115210342514240 is 42415243012511.
It is a self number, because there is not a number n which added to its sum of digits gives 115210342514240.
It is not an unprimeable number, because it can be changed into a prime (115210342514249) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 88872224 + ... + 90159263.
Almost surely, 2115210342514240 is an apocalyptic number.
115210342514240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115210342514240 is an abundant number, since it is smaller than the sum of its proper divisors (159270709124032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115210342514240 is a wasteful number, since it uses less digits than its factorization.
115210342514240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179033515 (or 179033505 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 115210342514240 its reverse (42415243012511), we get a palindrome (157625585526751).
The spelling of 115210342514240 in words is "one hundred fifteen trillion, two hundred ten billion, three hundred forty-two million, five hundred fourteen thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •