Base | Representation |
---|---|
bin | 11010001100110101011100… |
… | …010000101000111000111000 |
3 | 120002222222221020010210211022 |
4 | 122030311130100220320320 |
5 | 110100422022203400130 |
6 | 1045024254424122012 |
7 | 33162116121261350 |
oct | 3214653420507070 |
9 | 502888836123738 |
10 | 115231225450040 |
11 | 33797319770707 |
12 | 10b10700306308 |
13 | 4c3b3478b213b |
14 | 2065314889b60 |
15 | d4c6668987e5 |
hex | 68cd5c428e38 |
115231225450040 has 128 divisors (see below), whose sum is σ = 316414362009600. Its totient is φ = 36915008739840.
The previous prime is 115231225450031. The next prime is 115231225450067. The reversal of 115231225450040 is 40054522132511.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 228635984 + ... + 229139423.
It is an arithmetic number, because the mean of its divisors is an integer number (2471987203200).
Almost surely, 2115231225450040 is an apocalyptic number.
115231225450040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115231225450040 is an abundant number, since it is smaller than the sum of its proper divisors (201183136559560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115231225450040 is a wasteful number, since it uses less digits than its factorization.
115231225450040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457775485 (or 457775481 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 115231225450040 its reverse (40054522132511), we get a palindrome (155285747582551).
The spelling of 115231225450040 in words is "one hundred fifteen trillion, two hundred thirty-one billion, two hundred twenty-five million, four hundred fifty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •