Base | Representation |
---|---|
bin | 110100010100101110101111… |
… | …110010110111110100101001 |
3 | 1010011210112200200110221222010 |
4 | 310110232233302313310221 |
5 | 220130313402014213113 |
6 | 2133233014150350133 |
7 | 66320560342432416 |
oct | 6424565762676451 |
9 | 1104715620427863 |
10 | 230123002101033 |
11 | 67362687434458 |
12 | 2198746795b349 |
13 | 9b53676854122 |
14 | 40b8026d0910d |
15 | 1b9106267a1c3 |
hex | d14bafcb7d29 |
230123002101033 has 4 divisors (see below), whose sum is σ = 306830669468048. Its totient is φ = 153415334734020.
The previous prime is 230123002101029. The next prime is 230123002101061. The reversal of 230123002101033 is 330101200321032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 230123002101033 - 22 = 230123002101029 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230123002101133) 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, 38353833683503 + ... + 38353833683508.
It is an arithmetic number, because the mean of its divisors is an integer number (76707667367012).
Almost surely, 2230123002101033 is an apocalyptic number.
It is an amenable number.
230123002101033 is a deficient number, since it is larger than the sum of its proper divisors (76707667367015).
230123002101033 is an equidigital number, since it uses as much as digits as its factorization.
230123002101033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76707667367014.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 230123002101033 its reverse (330101200321032), we get a palindrome (560224202422065).
The spelling of 230123002101033 in words is "two hundred thirty trillion, one hundred twenty-three billion, two million, one hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •