Base | Representation |
---|---|
bin | 11010010000001100110100… |
… | …010111000110011000111001 |
3 | 120010211002212001110001020000 |
4 | 122100030310113012120321 |
5 | 110113214131434222311 |
6 | 1045322422155423213 |
7 | 33214613666053026 |
oct | 3220146427063071 |
9 | 503732761401200 |
10 | 115462484289081 |
11 | 3387640130a286 |
12 | 10b494a0454b09 |
13 | 4c570b101c277 |
14 | 20725b226054d |
15 | d5369e206056 |
hex | 6903345c6639 |
115462484289081 has 40 divisors (see below), whose sum is σ = 175038316801920. Its totient is φ = 75837878374752.
The previous prime is 115462484289067. The next prime is 115462484289151. The reversal of 115462484289081 is 180982484264511.
115462484289081 is a `hidden beast` number, since 1 + 1 + 5 + 4 + 6 + 2 + 48 + 428 + 90 + 81 = 666.
It is not a de Polignac number, because 115462484289081 - 27 = 115462484288953 is a prime.
It is a super-2 number, since 2×1154624842890812 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (115462484289001) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 16330546 + ... + 22307211.
It is an arithmetic number, because the mean of its divisors is an integer number (4375957920048).
Almost surely, 2115462484289081 is an apocalyptic number.
It is an amenable number.
115462484289081 is a deficient number, since it is larger than the sum of its proper divisors (59575832512839).
115462484289081 is an equidigital number, since it uses as much as digits as its factorization.
115462484289081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38638315 (or 38638306 counting only the distinct ones).
The product of its (nonzero) digits is 35389440, while the sum is 63.
The spelling of 115462484289081 in words is "one hundred fifteen trillion, four hundred sixty-two billion, four hundred eighty-four million, two hundred eighty-nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •