Base | Representation |
---|---|
bin | 11011011011100… |
… | …01000000010011 |
3 | 121000222100020200 |
4 | 31231301000103 |
5 | 432401213021 |
6 | 34455510243 |
7 | 5462553300 |
oct | 1555610023 |
9 | 530870220 |
10 | 230101011 |
11 | 108982328 |
12 | 65088383 |
13 | 3889625a |
14 | 227ba0a7 |
15 | 15303126 |
hex | db71013 |
230101011 has 36 divisors (see below), whose sum is σ = 388100232. Its totient is φ = 130987584.
The previous prime is 230101007. The next prime is 230101019. The reversal of 230101011 is 110101032.
It is not a de Polignac number, because 230101011 - 22 = 230101007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 230100984 and 230101002.
It is not an unprimeable number, because it can be changed into a prime (230101019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 137200 + ... + 138866.
It is an arithmetic number, because the mean of its divisors is an integer number (10780562).
Almost surely, 2230101011 is an apocalyptic number.
230101011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
230101011 is a deficient number, since it is larger than the sum of its proper divisors (157999221).
230101011 is a wasteful number, since it uses less digits than its factorization.
230101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000 (or 1990 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 230101011 is about 15169.0807565917. The cubic root of 230101011 is about 612.7822481476.
Adding to 230101011 its reverse (110101032), we get a palindrome (340202043).
The spelling of 230101011 in words is "two hundred thirty million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •