Base | Representation |
---|---|
bin | 11101101011111100010… |
… | …00001101100100010101 |
3 | 10121111212011212000222100 |
4 | 32311332020031210111 |
5 | 113203001433043333 |
6 | 2100331531552313 |
7 | 133460062154424 |
oct | 16657610154425 |
9 | 3544764760870 |
10 | 1020023331093 |
11 | 36365363aa08 |
12 | 14582b8bb699 |
13 | 75259751b50 |
14 | 375258832bb |
15 | 1b7ee590213 |
hex | ed7e20d915 |
1020023331093 has 24 divisors (see below), whose sum is σ = 1587165775832. Its totient is φ = 627523573248.
The previous prime is 1020023331079. The next prime is 1020023331169. The reversal of 1020023331093 is 3901333200201.
1020023331093 is a `hidden beast` number, since 10 + 20 + 0 + 233 + 310 + 93 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 47340186084 + 972683145009 = 217578^2 + 986247^2 .
It is not a de Polignac number, because 1020023331093 - 224 = 1020006553877 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020023331013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 868096 + ... + 1671417.
Almost surely, 21020023331093 is an apocalyptic number.
1020023331093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1020023331093 is a deficient number, since it is larger than the sum of its proper divisors (567142444739).
1020023331093 is a wasteful number, since it uses less digits than its factorization.
1020023331093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2542965 (or 2542962 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
Adding to 1020023331093 its reverse (3901333200201), we get a palindrome (4921356531294).
The spelling of 1020023331093 in words is "one trillion, twenty billion, twenty-three million, three hundred thirty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •