Base | Representation |
---|---|
bin | 100001101010101011111… |
… | …011111011101001010101 |
3 | 22012011202011022221210101 |
4 | 201222223323323221111 |
5 | 300401201204114424 |
6 | 4530502000454101 |
7 | 326102411124154 |
oct | 41525373735125 |
9 | 8164664287711 |
10 | 2313577019989 |
11 | 812200a05164 |
12 | 31447831a331 |
13 | 13a228175901 |
14 | 7dd98c4159b |
15 | 402ac5bc344 |
hex | 21aabefba55 |
2313577019989 has 4 divisors (see below), whose sum is σ = 2323951805056. Its totient is φ = 2303202234924.
The previous prime is 2313577019921. The next prime is 2313577020017. The reversal of 2313577019989 is 9899107753132.
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 2313577019989 - 27 = 2313577019861 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2313577019989.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313577049989) 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, 5187392199 + ... + 5187392644.
It is an arithmetic number, because the mean of its divisors is an integer number (580987951264).
Almost surely, 22313577019989 is an apocalyptic number.
It is an amenable number.
2313577019989 is a deficient number, since it is larger than the sum of its proper divisors (10374785067).
2313577019989 is a wasteful number, since it uses less digits than its factorization.
2313577019989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10374785066.
The product of its (nonzero) digits is 25719120, while the sum is 64.
The spelling of 2313577019989 in words is "two trillion, three hundred thirteen billion, five hundred seventy-seven million, nineteen thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •