Base | Representation |
---|---|
bin | 1010100011110110100100… |
… | …11010010101011010111111 |
3 | 10001020000100200221121201101 |
4 | 11101323102122111122333 |
5 | 11020432402032233043 |
6 | 121220032435153531 |
7 | 4614512602244134 |
oct | 521732232253277 |
9 | 101200320847641 |
10 | 23222123321023 |
11 | 74434a12404a0 |
12 | 273072a1458a7 |
13 | cc5ab56a24b3 |
14 | 5a3d5751858b |
15 | 2a40d9ddc24d |
hex | 151ed26956bf |
23222123321023 has 4 divisors (see below), whose sum is σ = 25333225441128. Its totient is φ = 21111021200920.
The previous prime is 23222123320987. The next prime is 23222123321029. The reversal of 23222123321023 is 32012332122232.
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 23222123321023 - 225 = 23222089766591 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23222123320982 and 23222123321000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23222123321029) 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, 1055551060036 + ... + 1055551060057.
It is an arithmetic number, because the mean of its divisors is an integer number (6333306360282).
Almost surely, 223222123321023 is an apocalyptic number.
23222123321023 is a deficient number, since it is larger than the sum of its proper divisors (2111102120105).
23222123321023 is a wasteful number, since it uses less digits than its factorization.
23222123321023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2111102120104.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 23222123321023 its reverse (32012332122232), we get a palindrome (55234455443255).
The spelling of 23222123321023 in words is "twenty-three trillion, two hundred twenty-two billion, one hundred twenty-three million, three hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •