Base | Representation |
---|---|
bin | 1010110111001100110101… |
… | …00101000111101001111001 |
3 | 10010120120021120212221102211 |
4 | 11123212122211013221321 |
5 | 11112330341034230001 |
6 | 122445254323055121 |
7 | 5013525545430340 |
oct | 533463245075171 |
9 | 103516246787384 |
10 | 23886906555001 |
11 | 767a420024586 |
12 | 28195388114a1 |
13 | 10436aaa41039 |
14 | 5c81bd608b57 |
15 | 2b6547397351 |
hex | 15b99a947a79 |
23886906555001 has 4 divisors (see below), whose sum is σ = 27299321777152. Its totient is φ = 20474491332852.
The previous prime is 23886906554939. The next prime is 23886906555011. The reversal of 23886906555001 is 10055560968832.
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 23886906555001 - 215 = 23886906522233 is a prime.
It is a super-2 number, since 2×238869065550012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23886906555011) 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, 1706207611065 + ... + 1706207611078.
It is an arithmetic number, because the mean of its divisors is an integer number (6824830444288).
Almost surely, 223886906555001 is an apocalyptic number.
It is an amenable number.
23886906555001 is a deficient number, since it is larger than the sum of its proper divisors (3412415222151).
23886906555001 is an equidigital number, since it uses as much as digits as its factorization.
23886906555001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3412415222150.
The product of its (nonzero) digits is 15552000, while the sum is 58.
The spelling of 23886906555001 in words is "twenty-three trillion, eight hundred eighty-six billion, nine hundred six million, five hundred fifty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •