Base | Representation |
---|---|
bin | 1101011010011001001… |
… | …1101110011100101101 |
3 | 211000202121101100122210 |
4 | 3112212103232130231 |
5 | 12233401401034113 |
6 | 253504410201033 |
7 | 22435052025045 |
oct | 3264623563455 |
9 | 730677340583 |
10 | 230423455533 |
11 | 897a4040687 |
12 | 387a8423179 |
13 | 18962348a7b |
14 | b21c878725 |
15 | 5ed93466c3 |
hex | 35a64ee72d |
230423455533 has 4 divisors (see below), whose sum is σ = 307231274048. Its totient is φ = 153615637020.
The previous prime is 230423455531. The next prime is 230423455547. The reversal of 230423455533 is 335554324032.
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 not a de Polignac number, because 230423455533 - 21 = 230423455531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230423455491 and 230423455500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230423455531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38403909253 + ... + 38403909258.
It is an arithmetic number, because the mean of its divisors is an integer number (76807818512).
Almost surely, 2230423455533 is an apocalyptic number.
It is an amenable number.
230423455533 is a deficient number, since it is larger than the sum of its proper divisors (76807818515).
230423455533 is an equidigital number, since it uses as much as digits as its factorization.
230423455533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76807818514.
The product of its (nonzero) digits is 648000, while the sum is 39.
Adding to 230423455533 its reverse (335554324032), we get a palindrome (565977779565).
The spelling of 230423455533 in words is "two hundred thirty billion, four hundred twenty-three million, four hundred fifty-five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •