Base | Representation |
---|---|
bin | 1101011001011000110… |
… | …1001011000100101001 |
3 | 211000001210001011002222 |
4 | 3112112031023010221 |
5 | 12232323221133223 |
6 | 253421520003425 |
7 | 22425261535244 |
oct | 3262615130451 |
9 | 730053034088 |
10 | 230153302313 |
11 | 896755a2560 |
12 | 38731a60575 |
13 | 1891b39b2ac |
14 | b1d4a3425b |
15 | 5ec07810c8 |
hex | 359634b129 |
230153302313 has 4 divisors (see below), whose sum is σ = 251076329808. Its totient is φ = 209230274820.
The previous prime is 230153302283. The next prime is 230153302349. The reversal of 230153302313 is 313203351032.
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 a cyclic number.
It is not a de Polignac number, because 230153302313 - 216 = 230153236777 is a prime.
It is a super-2 number, since 2×2301533023132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (230153302213) 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, 10461513731 + ... + 10461513752.
It is an arithmetic number, because the mean of its divisors is an integer number (62769082452).
Almost surely, 2230153302313 is an apocalyptic number.
It is an amenable number.
230153302313 is a deficient number, since it is larger than the sum of its proper divisors (20923027495).
230153302313 is a wasteful number, since it uses less digits than its factorization.
230153302313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20923027494.
The product of its (nonzero) digits is 4860, while the sum is 26.
Adding to 230153302313 its reverse (313203351032), we get a palindrome (543356653345).
The spelling of 230153302313 in words is "two hundred thirty billion, one hundred fifty-three million, three hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •