Base | Representation |
---|---|
bin | 111001011000000010… |
… | …0110000001011011111 |
3 | 102210000221020000211011 |
4 | 1302300010300023133 |
5 | 4004320024321343 |
6 | 132334152440051 |
7 | 11621223145564 |
oct | 1626004601337 |
9 | 383027200734 |
10 | 123213120223 |
11 | 48288659986 |
12 | 1ba679a9027 |
13 | b807a9aa3b |
14 | 5d6bd8886b |
15 | 33120e629d |
hex | 1cb01302df |
123213120223 has 4 divisors (see below), whose sum is σ = 124183302400. Its totient is φ = 122242938048.
The previous prime is 123213120193. The next prime is 123213120227. The reversal of 123213120223 is 322021312321.
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 123213120223 - 213 = 123213112031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123213120194 and 123213120203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123213120227) 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, 485090898 + ... + 485091151.
It is an arithmetic number, because the mean of its divisors is an integer number (31045825600).
Almost surely, 2123213120223 is an apocalyptic number.
123213120223 is a deficient number, since it is larger than the sum of its proper divisors (970182177).
123213120223 is an equidigital number, since it uses as much as digits as its factorization.
123213120223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 970182176.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 123213120223 its reverse (322021312321), we get a palindrome (445234432544).
The spelling of 123213120223 in words is "one hundred twenty-three billion, two hundred thirteen million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •