Base | Representation |
---|---|
bin | 1010110000111001011101… |
… | …11101000111010000101001 |
3 | 10002210212022120022012102010 |
4 | 11120130232331013100221 |
5 | 11100303340222300323 |
6 | 122202002043030133 |
7 | 4662061254612114 |
oct | 530345675072051 |
9 | 102725276265363 |
10 | 23670352540713 |
11 | 75a65a3a1943a |
12 | 27a358120b349 |
13 | 1029148c51248 |
14 | 5bb918b7d57b |
15 | 2b0ac0994c93 |
hex | 15872ef47429 |
23670352540713 has 4 divisors (see below), whose sum is σ = 31560470054288. Its totient is φ = 15780235027140.
The previous prime is 23670352540649. The next prime is 23670352540729. The reversal of 23670352540713 is 31704525307632.
It is a happy number.
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 not a de Polignac number, because 23670352540713 - 26 = 23670352540649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23670352545713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3945058756783 + ... + 3945058756788.
It is an arithmetic number, because the mean of its divisors is an integer number (7890117513572).
Almost surely, 223670352540713 is an apocalyptic number.
It is an amenable number.
23670352540713 is a deficient number, since it is larger than the sum of its proper divisors (7890117513575).
23670352540713 is an equidigital number, since it uses as much as digits as its factorization.
23670352540713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7890117513574.
The product of its (nonzero) digits is 3175200, while the sum is 48.
The spelling of 23670352540713 in words is "twenty-three trillion, six hundred seventy billion, three hundred fifty-two million, five hundred forty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •