Base | Representation |
---|---|
bin | 1001010011011110001001… |
… | …0000110111000000110111 |
3 | 1100012222201011211002222010 |
4 | 2110313202100313000313 |
5 | 2320102232434432411 |
6 | 33431352113335303 |
7 | 2104046512316646 |
oct | 224674220670067 |
9 | 40188634732863 |
10 | 10230113202231 |
11 | 329462622780a |
12 | 11927b8267533 |
13 | 592907126550 |
14 | 2751d66c535d |
15 | 12b196e027a6 |
hex | 94de2437037 |
10230113202231 has 16 divisors (see below), whose sum is σ = 14689710726656. Its totient is φ = 6295318245216.
The previous prime is 10230113202187. The next prime is 10230113202247. The reversal of 10230113202231 is 13220231103201.
It is not a de Polignac number, because 10230113202231 - 211 = 10230113200183 is a prime.
It is a super-2 number, since 2×102301132022312 (a number of 27 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 = 10230113202198 and 10230113202207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230113202251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 990835 + ... + 4630548.
It is an arithmetic number, because the mean of its divisors is an integer number (918106920416).
Almost surely, 210230113202231 is an apocalyptic number.
10230113202231 is a deficient number, since it is larger than the sum of its proper divisors (4459597524425).
10230113202231 is a wasteful number, since it uses less digits than its factorization.
10230113202231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5668062.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10230113202231 its reverse (13220231103201), we get a palindrome (23450344305432).
The spelling of 10230113202231 in words is "ten trillion, two hundred thirty billion, one hundred thirteen million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •