Base | Representation |
---|---|
bin | 1101011001010000111… |
… | …1010010011010010111 |
3 | 210222222110221120111201 |
4 | 3112110033102122113 |
5 | 12232241244132411 |
6 | 253414340413331 |
7 | 22424411203141 |
oct | 3262417223227 |
9 | 728873846451 |
10 | 230120302231 |
11 | 89658a03066 |
12 | 387229a7247 |
13 | 189145b5911 |
14 | b1d04c3c91 |
15 | 5ebc9133c1 |
hex | 35943d2697 |
230120302231 has 8 divisors (see below), whose sum is σ = 233992398528. Its totient is φ = 226251420000.
The previous prime is 230120302063. The next prime is 230120302241. The reversal of 230120302231 is 132203021032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 230120302231 - 235 = 195760563863 is a prime.
It is a super-2 number, since 2×2301203022312 (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 = 230120302199 and 230120302208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230120302241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 658900 + ... + 945721.
It is an arithmetic number, because the mean of its divisors is an integer number (29249049816).
Almost surely, 2230120302231 is an apocalyptic number.
230120302231 is a deficient number, since it is larger than the sum of its proper divisors (3872096297).
230120302231 is a wasteful number, since it uses less digits than its factorization.
230120302231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1607033.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 230120302231 its reverse (132203021032), we get a palindrome (362323323263).
The spelling of 230120302231 in words is "two hundred thirty billion, one hundred twenty million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •