Base | Representation |
---|---|
bin | 1010011101011001111101… |
… | …11100111001110111100111 |
3 | 10000102211120210001221120110 |
4 | 11032230332330321313213 |
5 | 11003320220120220033 |
6 | 120530155454504103 |
7 | 4562511313262220 |
oct | 516547674716747 |
9 | 100384523057513 |
10 | 23000606023143 |
11 | 7368558525991 |
12 | 26b5808505033 |
13 | caac4253abc8 |
14 | 597341828247 |
15 | 29d4728d7363 |
hex | 14eb3ef39de7 |
23000606023143 has 32 divisors (see below), whose sum is σ = 35284590673920. Its totient is φ = 13054704818400.
The previous prime is 23000606023123. The next prime is 23000606023163. The reversal of 23000606023143 is 34132060600032.
It is an interprime number because it is at equal distance from previous prime (23000606023123) and next prime (23000606023163).
It is not a de Polignac number, because 23000606023143 - 213 = 23000606014951 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23000606023143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23000606023123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28325746 + ... + 29126432.
It is an arithmetic number, because the mean of its divisors is an integer number (1102643458560).
Almost surely, 223000606023143 is an apocalyptic number.
23000606023143 is a deficient number, since it is larger than the sum of its proper divisors (12283984650777).
23000606023143 is a wasteful number, since it uses less digits than its factorization.
23000606023143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 809907.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 23000606023143 its reverse (34132060600032), we get a palindrome (57132666623175).
The spelling of 23000606023143 in words is "twenty-three trillion, six hundred six million, twenty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •