Base | Representation |
---|---|
bin | 110100010100100011100101… |
… | …000100111000000110011011 |
3 | 1010011202101202000022120102010 |
4 | 310110203211010320012123 |
5 | 220130114322321030243 |
6 | 2133223312242041003 |
7 | 66316654240623636 |
oct | 6424434504700633 |
9 | 1104671660276363 |
10 | 230111011111323 |
11 | 67358593877401 |
12 | 21985080049163 |
13 | 9b524b5525844 |
14 | 40b760a594c1d |
15 | 1b90aaead9433 |
hex | d148e513819b |
230111011111323 has 8 divisors (see below), whose sum is σ = 307026716512768. Its totient is φ = 153301323225384.
The previous prime is 230111011111283. The next prime is 230111011111361. The reversal of 230111011111323 is 323111110111032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 230111011111323 - 213 = 230111011103131 is a prime.
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 230111011111323.
It is not an unprimeable number, because it can be changed into a prime (230111011111123) 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, 26504373811 + ... + 26504382492.
It is an arithmetic number, because the mean of its divisors is an integer number (38378339564096).
Almost surely, 2230111011111323 is an apocalyptic number.
230111011111323 is a deficient number, since it is larger than the sum of its proper divisors (76915705401445).
230111011111323 is a wasteful number, since it uses less digits than its factorization.
230111011111323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53008757753.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 230111011111323 its reverse (323111110111032), we get a palindrome (553222121222355).
The spelling of 230111011111323 in words is "two hundred thirty trillion, one hundred eleven billion, eleven million, one hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •