Base | Representation |
---|---|
bin | 1101011001010011100… |
… | …0111011111010011011 |
3 | 211000000020111021001002 |
4 | 3112110320323322123 |
5 | 12232302043020443 |
6 | 253415410415215 |
7 | 22424603044550 |
oct | 3262470737233 |
9 | 730006437032 |
10 | 230131220123 |
11 | 8966408a912 |
12 | 3872659150b |
13 | 189169391cc |
14 | b1d1b26a27 |
15 | 5ebd86d2b8 |
hex | 3594e3be9b |
230131220123 has 4 divisors (see below), whose sum is σ = 263007108720. Its totient is φ = 197255331528.
The previous prime is 230131220107. The next prime is 230131220131. The reversal of 230131220123 is 321022131032.
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 230131220123 - 24 = 230131220107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230131220095 and 230131220104.
It is not an unprimeable number, because it can be changed into a prime (230131220323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16437944288 + ... + 16437944301.
It is an arithmetic number, because the mean of its divisors is an integer number (65751777180).
Almost surely, 2230131220123 is an apocalyptic number.
230131220123 is a deficient number, since it is larger than the sum of its proper divisors (32875888597).
230131220123 is an equidigital number, since it uses as much as digits as its factorization.
230131220123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32875888596.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 230131220123 its reverse (321022131032), we get a palindrome (551153351155).
The spelling of 230131220123 in words is "two hundred thirty billion, one hundred thirty-one million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •