Base | Representation |
---|---|
bin | 11101011101001100111… |
… | …10001000001001010101 |
3 | 10120202102200221212002211 |
4 | 32232212132020021111 |
5 | 113040300204330401 |
6 | 2052542414433421 |
7 | 133060015003225 |
oct | 16564636101125 |
9 | 3522380855084 |
10 | 1012110230101 |
11 | 360262926023 |
12 | 1441a1802871 |
13 | 74598216379 |
14 | 36db495a085 |
15 | 1b4d9a0c951 |
hex | eba6788255 |
1012110230101 has 8 divisors (see below), whose sum is σ = 1065407019680. Its totient is φ = 958816223568.
The previous prime is 1012110230077. The next prime is 1012110230107. The reversal of 1012110230101 is 1010320112101.
It is a happy number.
1012110230101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1012110230101 - 237 = 874671276629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012110230107) 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, 72490 + ... + 1424596.
It is an arithmetic number, because the mean of its divisors is an integer number (133175877460).
Almost surely, 21012110230101 is an apocalyptic number.
It is an amenable number.
1012110230101 is a deficient number, since it is larger than the sum of its proper divisors (53296789579).
1012110230101 is a wasteful number, since it uses less digits than its factorization.
1012110230101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1391523.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1012110230101 its reverse (1010320112101), we get a palindrome (2022430342202).
The spelling of 1012110230101 in words is "one trillion, twelve billion, one hundred ten million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •