Base | Representation |
---|---|
bin | 110101101001010100… |
… | …1111010101101010111 |
3 | 102000100201102201101211 |
4 | 1223102221322231113 |
5 | 3341414024302211 |
6 | 124531303402251 |
7 | 11215563230035 |
oct | 1532251725527 |
9 | 360321381354 |
10 | 115203353431 |
11 | 44948320601 |
12 | 1a3b1453387 |
13 | ab2c51826a |
14 | 580c29b555 |
15 | 2ee3d1be21 |
hex | 1ad2a7ab57 |
115203353431 has 8 divisors (see below), whose sum is σ = 115825666880. Its totient is φ = 114581302272.
The previous prime is 115203353411. The next prime is 115203353437. The reversal of 115203353431 is 134353302511.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115203353431 - 233 = 106613418839 is a prime.
It is a super-2 number, since 2×1152033534312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115203353393 and 115203353402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115203353437) 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, 849586 + ... + 975808.
It is an arithmetic number, because the mean of its divisors is an integer number (14478208360).
Almost surely, 2115203353431 is an apocalyptic number.
115203353431 is a deficient number, since it is larger than the sum of its proper divisors (622313449).
115203353431 is a wasteful number, since it uses less digits than its factorization.
115203353431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131145.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 115203353431 its reverse (134353302511), we get a palindrome (249556655942).
The spelling of 115203353431 in words is "one hundred fifteen billion, two hundred three million, three hundred fifty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •