Base | Representation |
---|---|
bin | 11110110001110111100… |
… | …101001000101111001101 |
3 | 21111012112001111121102212 |
4 | 132301313211020233031 |
5 | 234123241303232303 |
6 | 4255402151200205 |
7 | 305545616330561 |
oct | 36616745105715 |
9 | 7435461447385 |
10 | 2115130133453 |
11 | 746026901107 |
12 | 2a1b14976065 |
13 | 1245c08542ac |
14 | 7453112b6a1 |
15 | 3a045684ad8 |
hex | 1ec77948bcd |
2115130133453 has 4 divisors (see below), whose sum is σ = 2164319206368. Its totient is φ = 2065941060540.
The previous prime is 2115130133429. The next prime is 2115130133497. The reversal of 2115130133453 is 3543310315112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2115130133453 - 226 = 2115063024589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2115130133953) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24594536393 + ... + 24594536478.
It is an arithmetic number, because the mean of its divisors is an integer number (541079801592).
Almost surely, 22115130133453 is an apocalyptic number.
It is an amenable number.
2115130133453 is a deficient number, since it is larger than the sum of its proper divisors (49189072915).
2115130133453 is an equidigital number, since it uses as much as digits as its factorization.
2115130133453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49189072914.
The product of its (nonzero) digits is 16200, while the sum is 32.
Adding to 2115130133453 its reverse (3543310315112), we get a palindrome (5658440448565).
The spelling of 2115130133453 in words is "two trillion, one hundred fifteen billion, one hundred thirty million, one hundred thirty-three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •