Base | Representation |
---|---|
bin | 1101011001001110011… |
… | …1111111011111001101 |
3 | 210222221202120020000101 |
4 | 3112103213333133031 |
5 | 12232231130013401 |
6 | 253413331531101 |
7 | 22424224510531 |
oct | 3262347773715 |
9 | 728852506011 |
10 | 230110001101 |
11 | 89653107732 |
12 | 3871b459a91 |
13 | 18912419c86 |
14 | b1ccda1bc1 |
15 | 5ebba7b101 |
hex | 35939ff7cd |
230110001101 has 8 divisors (see below), whose sum is σ = 233383007808. Its totient is φ = 226837884000.
The previous prime is 230110001063. The next prime is 230110001117. The reversal of 230110001101 is 101100011032.
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 230110001101 - 213 = 230109992909 is a prime.
It is a super-2 number, since 2×2301100011012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230110001201) 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, 307521 + ... + 744841.
It is an arithmetic number, because the mean of its divisors is an integer number (29172875976).
Almost surely, 2230110001101 is an apocalyptic number.
It is an amenable number.
230110001101 is a deficient number, since it is larger than the sum of its proper divisors (3273006707).
230110001101 is an equidigital number, since it uses as much as digits as its factorization.
230110001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 444803.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 230110001101 its reverse (101100011032), we get a palindrome (331210012133).
It can be divided in two parts, 2 and 30110001101, that added together give a palindrome (30110001103).
The spelling of 230110001101 in words is "two hundred thirty billion, one hundred ten million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •