Base | Representation |
---|---|
bin | 1010100011000100000011… |
… | …10001011100000100101111 |
3 | 10001010102100110210121120112 |
4 | 11101202001301130010233 |
5 | 11020011330124304221 |
6 | 121155345225410235 |
7 | 4612532511135053 |
oct | 521420161340457 |
9 | 101112313717515 |
10 | 23195000619311 |
11 | 7432a43180234 |
12 | 272741a93997b |
13 | cc3382460081 |
14 | 5a2903295c63 |
15 | 2a354dbbb15b |
hex | 151881c5c12f |
23195000619311 has 4 divisors (see below), whose sum is σ = 23204908780824. Its totient is φ = 23185092457800.
The previous prime is 23195000619289. The next prime is 23195000619389. The reversal of 23195000619311 is 11391600059132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23195000619311 - 238 = 22920122712367 is a prime.
It is a super-2 number, since 2×231950006193112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23195000679311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4954077245 + ... + 4954081926.
It is an arithmetic number, because the mean of its divisors is an integer number (5801227195206).
Almost surely, 223195000619311 is an apocalyptic number.
23195000619311 is a deficient number, since it is larger than the sum of its proper divisors (9908161513).
23195000619311 is an equidigital number, since it uses as much as digits as its factorization.
23195000619311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9908161512.
The product of its (nonzero) digits is 43740, while the sum is 41.
The spelling of 23195000619311 in words is "twenty-three trillion, one hundred ninety-five billion, six hundred nineteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •