Base | Representation |
---|---|
bin | 1101011001100111000… |
… | …1110000001011010011 |
3 | 211000012221210110000020 |
4 | 3112121301300023103 |
5 | 12232434041114443 |
6 | 253431500154523 |
7 | 22426620052422 |
oct | 3263161601323 |
9 | 730187713006 |
10 | 230213223123 |
11 | 896a63a9994 |
12 | 38749b38a43 |
13 | 1892a91b1b0 |
14 | b1dc9912b9 |
15 | 5ec5b6a583 |
hex | 3599c702d3 |
230213223123 has 16 divisors (see below), whose sum is σ = 330839728800. Its totient is φ = 141550896384.
The previous prime is 230213223091. The next prime is 230213223131. The reversal of 230213223123 is 321322312032.
230213223123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 230213223123 - 25 = 230213223091 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 230213223093 and 230213223102.
It is not an unprimeable number, because it can be changed into a prime (230213223223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2427448 + ... + 2520501.
It is an arithmetic number, because the mean of its divisors is an integer number (20677483050).
Almost surely, 2230213223123 is an apocalyptic number.
230213223123 is a deficient number, since it is larger than the sum of its proper divisors (100626505677).
230213223123 is a wasteful number, since it uses less digits than its factorization.
230213223123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4949158.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 230213223123 its reverse (321322312032), we get a palindrome (551535535155).
The spelling of 230213223123 in words is "two hundred thirty billion, two hundred thirteen million, two hundred twenty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •