Base | Representation |
---|---|
bin | 1101011001010001101… |
… | …0000111100110011011 |
3 | 210222222200021211021222 |
4 | 3112110122013212123 |
5 | 12232243011012111 |
6 | 253414521322255 |
7 | 22424444300033 |
oct | 3262432074633 |
9 | 728880254258 |
10 | 230123141531 |
11 | 8965a572298 |
12 | 3872393638b |
13 | 1891506b08a |
14 | b1d0a228c3 |
15 | 5ebccc47db |
hex | 359468799b |
230123141531 has 8 divisors (see below), whose sum is σ = 230630400000. Its totient is φ = 229616248680.
The previous prime is 230123141527. The next prime is 230123141533. The reversal of 230123141531 is 135141321032.
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 230123141531 - 22 = 230123141527 is a prime.
It is a super-2 number, since 2×2301231415312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 230123141531.
It is not an unprimeable number, because it can be changed into a prime (230123141533) 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, 1188470 + ... + 1368468.
It is an arithmetic number, because the mean of its divisors is an integer number (28828800000).
Almost surely, 2230123141531 is an apocalyptic number.
230123141531 is a deficient number, since it is larger than the sum of its proper divisors (507258469).
230123141531 is a wasteful number, since it uses less digits than its factorization.
230123141531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182809.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 230123141531 its reverse (135141321032), we get a palindrome (365264462563).
The spelling of 230123141531 in words is "two hundred thirty billion, one hundred twenty-three million, one hundred forty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •