Base | Representation |
---|---|
bin | 1101100100000010011… |
… | …0010001110010000001 |
3 | 211021110000012112222122 |
4 | 3121000212101302001 |
5 | 12304202033310423 |
6 | 255013320014025 |
7 | 22556153256311 |
oct | 3310046216201 |
9 | 737400175878 |
10 | 233012010113 |
11 | 8a902228a93 |
12 | 391ab301315 |
13 | 18c8571227c |
14 | b3c657b441 |
15 | 60db7158c8 |
hex | 3640991c81 |
233012010113 has 4 divisors (see below), whose sum is σ = 237408463188. Its totient is φ = 228615557040.
The previous prime is 233012010073. The next prime is 233012010157. The reversal of 233012010113 is 311010210332.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 167799194689 + 65212815424 = 409633^2 + 255368^2 .
It is a cyclic number.
It is not a de Polignac number, because 233012010113 - 210 = 233012009089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 233012010091 and 233012010100.
It is not an unprimeable number, because it can be changed into a prime (233012010193) 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, 2198226458 + ... + 2198226563.
It is an arithmetic number, because the mean of its divisors is an integer number (59352115797).
Almost surely, 2233012010113 is an apocalyptic number.
It is an amenable number.
233012010113 is a deficient number, since it is larger than the sum of its proper divisors (4396453075).
233012010113 is an equidigital number, since it uses as much as digits as its factorization.
233012010113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4396453074.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 233012010113 its reverse (311010210332), we get a palindrome (544022220445).
The spelling of 233012010113 in words is "two hundred thirty-three billion, twelve million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •