Base | Representation |
---|---|
bin | 10101011100101100… |
… | …111100001010100001 |
3 | 2012110000020100222221 |
4 | 111130230330022201 |
5 | 334131202333441 |
6 | 14325131231041 |
7 | 1443464541160 |
oct | 253454741241 |
9 | 65400210887 |
10 | 23030121121 |
11 | 98489a2957 |
12 | 45688a8481 |
13 | 22303a7307 |
14 | 11868cd3d7 |
15 | 8ebcae8d1 |
hex | 55cb3c2a1 |
23030121121 has 4 divisors (see below), whose sum is σ = 26320138432. Its totient is φ = 19740103812.
The previous prime is 23030121097. The next prime is 23030121131. The reversal of 23030121121 is 12112103032.
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 23030121121 - 219 = 23029596833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23030121095 and 23030121104.
It is not an unprimeable number, because it can be changed into a prime (23030121131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1645008645 + ... + 1645008658.
It is an arithmetic number, because the mean of its divisors is an integer number (6580034608).
Almost surely, 223030121121 is an apocalyptic number.
It is an amenable number.
23030121121 is a deficient number, since it is larger than the sum of its proper divisors (3290017311).
23030121121 is an equidigital number, since it uses as much as digits as its factorization.
23030121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3290017310.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 23030121121 its reverse (12112103032), we get a palindrome (35142224153).
The spelling of 23030121121 in words is "twenty-three billion, thirty million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •