Base | Representation |
---|---|
bin | 1010100000010011011110… |
… | …01110001010010101100011 |
3 | 10000210100122122220022121211 |
4 | 11100021233032022111203 |
5 | 11011433202211214334 |
6 | 121044030241330551 |
7 | 4602635331052663 |
oct | 520115716122543 |
9 | 100710578808554 |
10 | 23100200101219 |
11 | 73a681581091a |
12 | 2710b82336a57 |
13 | cb7454c14757 |
14 | 59c0ac9c21a3 |
15 | 2a0d5118da64 |
hex | 15026f38a563 |
23100200101219 has 4 divisors (see below), whose sum is σ = 23179040374896. Its totient is φ = 23021359827544.
The previous prime is 23100200101217. The next prime is 23100200101291. The reversal of 23100200101219 is 91210100200132.
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 23100200101219 - 21 = 23100200101217 is a prime.
It is a super-2 number, since 2×231002001012192 (a number of 28 digits) contains 22 as substring.
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 23100200101219.
It is not an unprimeable number, because it can be changed into a prime (23100200101211) 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, 39420136399 + ... + 39420136984.
It is an arithmetic number, because the mean of its divisors is an integer number (5794760093724).
Almost surely, 223100200101219 is an apocalyptic number.
23100200101219 is a deficient number, since it is larger than the sum of its proper divisors (78840273677).
23100200101219 is an equidigital number, since it uses as much as digits as its factorization.
23100200101219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78840273676.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 23100200101219 in words is "twenty-three trillion, one hundred billion, two hundred million, one hundred one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •