Base | Representation |
---|---|
bin | 1101011001111100100… |
… | …0101110100101110111 |
3 | 211000110012222021211111 |
4 | 3112133020232211313 |
5 | 12233130100211043 |
6 | 253444431215451 |
7 | 22432061215456 |
oct | 3263710564567 |
9 | 730405867744 |
10 | 230303132023 |
11 | 89742128868 |
12 | 38774077587 |
13 | 1894343a823 |
14 | b20a8b6b9d |
15 | 5ecd9ca09d |
hex | 359f22e977 |
230303132023 has 4 divisors (see below), whose sum is σ = 230469898888. Its totient is φ = 230136365160.
The previous prime is 230303131997. The next prime is 230303132093. The reversal of 230303132023 is 320231303032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230303132023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230303131985 and 230303132003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230303132093) 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, 83381361 + ... + 83384122.
It is an arithmetic number, because the mean of its divisors is an integer number (57617474722).
Almost surely, 2230303132023 is an apocalyptic number.
230303132023 is a deficient number, since it is larger than the sum of its proper divisors (166766865).
230303132023 is a wasteful number, since it uses less digits than its factorization.
230303132023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166766864.
The product of its (nonzero) digits is 1944, while the sum is 22.
Adding to 230303132023 its reverse (320231303032), we get a palindrome (550534435055).
The spelling of 230303132023 in words is "two hundred thirty billion, three hundred three million, one hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •