Base | Representation |
---|---|
bin | 1010011101011001010001… |
… | …00010111101001000100111 |
3 | 10000102210121120202012011202 |
4 | 11032230220202331020213 |
5 | 11003313432402401043 |
6 | 120530054305553115 |
7 | 4562466100210460 |
oct | 516545042751047 |
9 | 100383546665152 |
10 | 23000230122023 |
11 | 736838531a900 |
12 | 26b572264579b |
13 | caabb26b65cb |
14 | 597307937d67 |
15 | 29d44e8d41b8 |
hex | 14eb288bd227 |
23000230122023 has 24 divisors (see below), whose sum is σ = 28893667353600. Its totient is φ = 17921750893200.
The previous prime is 23000230121971. The next prime is 23000230122041. The reversal of 23000230122023 is 32022103200032.
It is not a de Polignac number, because 23000230122023 - 238 = 22725352215079 is a prime.
It is a super-2 number, since 2×230002301220232 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23000230121986 and 23000230122004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23000230127023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31142558 + ... + 31872548.
It is an arithmetic number, because the mean of its divisors is an integer number (1203902806400).
Almost surely, 223000230122023 is an apocalyptic number.
23000230122023 is a deficient number, since it is larger than the sum of its proper divisors (5893437231577).
23000230122023 is a wasteful number, since it uses less digits than its factorization.
23000230122023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 767219 (or 767208 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 23000230122023 its reverse (32022103200032), we get a palindrome (55022333322055).
The spelling of 23000230122023 in words is "twenty-three trillion, two hundred thirty million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •