Base | Representation |
---|---|
bin | 111001011011010101… |
… | …0111101101101110001 |
3 | 102210022122111011112012 |
4 | 1302312222331231301 |
5 | 4010031343103213 |
6 | 132353145012305 |
7 | 11624036002451 |
oct | 1626652755561 |
9 | 383278434465 |
10 | 123323800433 |
11 | 48335085629 |
12 | 1ba98a84095 |
13 | b8249b08a2 |
14 | 5d7c959d61 |
15 | 331bbaa4a8 |
hex | 1cb6abdb71 |
123323800433 has 2 divisors, whose sum is σ = 123323800434. Its totient is φ = 123323800432.
The previous prime is 123323800429. The next prime is 123323800543. The reversal of 123323800433 is 334008323321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95618863729 + 27704936704 = 309223^2 + 166448^2 .
It is an emirp because it is prime and its reverse (334008323321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123323800433 - 22 = 123323800429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123323800433.
It is not a weakly prime, because it can be changed into another prime (123323800333) 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 as a sum of consecutive naturals, namely, 61661900216 + 61661900217.
It is an arithmetic number, because the mean of its divisors is an integer number (61661900217).
Almost surely, 2123323800433 is an apocalyptic number.
It is an amenable number.
123323800433 is a deficient number, since it is larger than the sum of its proper divisors (1).
123323800433 is an equidigital number, since it uses as much as digits as its factorization.
123323800433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 32.
The spelling of 123323800433 in words is "one hundred twenty-three billion, three hundred twenty-three million, eight hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •