Base | Representation |
---|---|
bin | 11101011001101101000… |
… | …01010111001110011011 |
3 | 10120120120210210102002002 |
4 | 32230312201113032123 |
5 | 113022423344430412 |
6 | 2052032202231215 |
7 | 132662330400416 |
oct | 16546641271633 |
9 | 3516523712062 |
10 | 1010232030107 |
11 | 35a48970a623 |
12 | 1439587b550b |
13 | 74359076321 |
14 | 36c77328b7d |
15 | 1b429ba8dc2 |
hex | eb3685739b |
1010232030107 has 2 divisors, whose sum is σ = 1010232030108. Its totient is φ = 1010232030106.
The previous prime is 1010232030103. The next prime is 1010232030127. The reversal of 1010232030107 is 7010302320101.
It is an a-pointer prime, because the next prime (1010232030127) can be obtained adding 1010232030107 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1010232030107 - 22 = 1010232030103 is a prime.
It is a super-2 number, since 2×10102320301072 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1010232030103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505116015053 + 505116015054.
It is an arithmetic number, because the mean of its divisors is an integer number (505116015054).
Almost surely, 21010232030107 is an apocalyptic number.
1010232030107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010232030107 is an equidigital number, since it uses as much as digits as its factorization.
1010232030107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 20.
Adding to 1010232030107 its reverse (7010302320101), we get a palindrome (8020534350208).
The spelling of 1010232030107 in words is "one trillion, ten billion, two hundred thirty-two million, thirty thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •