Base | Representation |
---|---|
bin | 1010101000000110011101… |
… | …00101101110011100111011 |
3 | 10001201222010020101222020012 |
4 | 11110003032211232130323 |
5 | 11030330321022230311 |
6 | 121411052414452135 |
7 | 4631201002261562 |
oct | 524031645563473 |
9 | 101658106358205 |
10 | 23368088086331 |
11 | 749a39457a03a |
12 | 2754a8550404b |
13 | 10067a7c44701 |
14 | 5ab042dc2bd9 |
15 | 2a7cce5d678b |
hex | 1540ce96e73b |
23368088086331 has 8 divisors (see below), whose sum is σ = 24743465737344. Its totient is φ = 21992797572480.
The previous prime is 23368088086313. The next prime is 23368088086337. The reversal of 23368088086331 is 13368088086332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23368088086331 - 226 = 23368020977467 is a prime.
It is a super-2 number, since 2×233680880863312 (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 (23368088086337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21231755 + ... + 22305236.
It is an arithmetic number, because the mean of its divisors is an integer number (3092933217168).
Almost surely, 223368088086331 is an apocalyptic number.
23368088086331 is a deficient number, since it is larger than the sum of its proper divisors (1375377651013).
23368088086331 is a wasteful number, since it uses less digits than its factorization.
23368088086331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43568581.
The product of its (nonzero) digits is 23887872, while the sum is 59.
Subtracting from 23368088086331 its reverse (13368088086332), we obtain a palindrome (9999999999999).
The spelling of 23368088086331 in words is "twenty-three trillion, three hundred sixty-eight billion, eighty-eight million, eighty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •