Base | Representation |
---|---|
bin | 1101011001111110011… |
… | …1100101010001010111 |
3 | 211000110210012012212201 |
4 | 3112133213211101113 |
5 | 12233134133022221 |
6 | 253445320425331 |
7 | 22432220033464 |
oct | 3263747452127 |
9 | 730423165781 |
10 | 230311220311 |
11 | 897467526a7 |
12 | 38776918247 |
13 | 189450101b3 |
14 | b20b9c066b |
15 | 5ece576891 |
hex | 359f9e5457 |
230311220311 has 4 divisors (see below), whose sum is σ = 230565147592. Its totient is φ = 230057293032.
The previous prime is 230311220197. The next prime is 230311220339. The reversal of 230311220311 is 113022113032.
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 230311220311 - 219 = 230310696023 is a prime.
It is a super-2 number, since 2×2303112203112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230311220411) 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, 126962280 + ... + 126964093.
It is an arithmetic number, because the mean of its divisors is an integer number (57641286898).
Almost surely, 2230311220311 is an apocalyptic number.
230311220311 is a deficient number, since it is larger than the sum of its proper divisors (253927281).
230311220311 is an equidigital number, since it uses as much as digits as its factorization.
230311220311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253927280.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 230311220311 its reverse (113022113032), we get a palindrome (343333333343).
The spelling of 230311220311 in words is "two hundred thirty billion, three hundred eleven million, two hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •