Base | Representation |
---|---|
bin | 11010001110010011011010… |
… | …001110101001100010010001 |
3 | 120010100122100221212202202202 |
4 | 122032103122032221202101 |
5 | 110104100142003333200 |
6 | 1045142502415052545 |
7 | 33202320345222062 |
oct | 3216233216514221 |
9 | 503318327782682 |
10 | 115332123105425 |
11 | 33826095877566 |
12 | 10b2817a811155 |
13 | 4c47a07376cc5 |
14 | 206a166c16569 |
15 | d500be7ea1d5 |
hex | 68e4da3a9891 |
115332123105425 has 6 divisors (see below), whose sum is σ = 143011832650758. Its totient is φ = 92265698484320.
The previous prime is 115332123105401. The next prime is 115332123105439. The reversal of 115332123105425 is 524501321233511.
It can be written as a sum of positive squares in 3 ways, for example, as 35411401759504 + 79920721345921 = 5950748^2 + 8939839^2 .
It is not a de Polignac number, because 115332123105425 - 214 = 115332123089041 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2306642462084 + ... + 2306642462133.
It is an arithmetic number, because the mean of its divisors is an integer number (23835305441793).
Almost surely, 2115332123105425 is an apocalyptic number.
It is an amenable number.
115332123105425 is a deficient number, since it is larger than the sum of its proper divisors (27679709545333).
115332123105425 is an equidigital number, since it uses as much as digits as its factorization.
115332123105425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4613284924227 (or 4613284924222 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 38.
Adding to 115332123105425 its reverse (524501321233511), we get a palindrome (639833444338936).
The spelling of 115332123105425 in words is "one hundred fifteen trillion, three hundred thirty-two billion, one hundred twenty-three million, one hundred five thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •