Base | Representation |
---|---|
bin | 111100010101010… |
… | …110101110111101 |
3 | 2121112200200000210 |
4 | 330111112232331 |
5 | 4033112343401 |
6 | 244235343033 |
7 | 34040552040 |
oct | 7425265675 |
9 | 2545620023 |
10 | 1012231101 |
11 | 47a418232 |
12 | 242bb1a79 |
13 | 13193041b |
14 | 98612c57 |
15 | 5dcea4d6 |
hex | 3c556bbd |
1012231101 has 8 divisors (see below), whose sum is σ = 1542447424. Its totient is φ = 578417760.
The previous prime is 1012231093. The next prime is 1012231111. The reversal of 1012231101 is 1011322101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012231101 - 23 = 1012231093 is a prime.
It is a super-2 number, since 2×10122311012 = 2049223603663344402, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012231111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24100720 + ... + 24100761.
It is an arithmetic number, because the mean of its divisors is an integer number (192805928).
Almost surely, 21012231101 is an apocalyptic number.
It is an amenable number.
1012231101 is a deficient number, since it is larger than the sum of its proper divisors (530216323).
1012231101 is an equidigital number, since it uses as much as digits as its factorization.
1012231101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48201491.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1012231101 is about 31815.5795326755. The cubic root of 1012231101 is about 1004.0605234991.
Adding to 1012231101 its reverse (1011322101), we get a palindrome (2023553202).
The spelling of 1012231101 in words is "one billion, twelve million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •