Base | Representation |
---|---|
bin | 1101011010110000100… |
… | …0111111001001001111 |
3 | 211001000102111120000102 |
4 | 3112230020333021033 |
5 | 12234101423204011 |
6 | 253522223321315 |
7 | 22440350515343 |
oct | 3265410771117 |
9 | 731012446012 |
10 | 230521303631 |
11 | 898442a2383 |
12 | 3881515023b |
13 | 189796b7c58 |
14 | b22b869623 |
15 | 5ee2c2373b |
hex | 35ac23f24f |
230521303631 has 4 divisors (see below), whose sum is σ = 230606088000. Its totient is φ = 230436519264.
The previous prime is 230521303603. The next prime is 230521303673. The reversal of 230521303631 is 136303125032.
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 230521303631 - 26 = 230521303567 is a prime.
It is a super-2 number, since 2×2305213036312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230521303594 and 230521303603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230521303531) 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, 42388106 + ... + 42393543.
It is an arithmetic number, because the mean of its divisors is an integer number (57651522000).
Almost surely, 2230521303631 is an apocalyptic number.
230521303631 is a deficient number, since it is larger than the sum of its proper divisors (84784369).
230521303631 is an equidigital number, since it uses as much as digits as its factorization.
230521303631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84784368.
The product of its (nonzero) digits is 9720, while the sum is 29.
Adding to 230521303631 its reverse (136303125032), we get a palindrome (366824428663).
The spelling of 230521303631 in words is "two hundred thirty billion, five hundred twenty-one million, three hundred three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •