Base | Representation |
---|---|
bin | 11101110001101100001… |
… | …11011000001001100001 |
3 | 10121210211022012011100122 |
4 | 32320312013120021201 |
5 | 113230312142320113 |
6 | 2102002120330025 |
7 | 133626423350201 |
oct | 16706607301141 |
9 | 3553738164318 |
10 | 1023110120033 |
11 | 364997a99151 |
12 | 146351613915 |
13 | 7562c102891 |
14 | 377397dc401 |
15 | 1b930579408 |
hex | ee361d8261 |
1023110120033 has 16 divisors (see below), whose sum is σ = 1040219761920. Its totient is φ = 1006055960976.
The previous prime is 1023110119973. The next prime is 1023110120041. The reversal of 1023110120033 is 3300210113201.
It is a cyclic number.
It is not a de Polignac number, because 1023110120033 - 214 = 1023110103649 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1023110119993 and 1023110120020.
It is not an unprimeable number, because it can be changed into a prime (1023110120933) 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 15 ways as a sum of consecutive naturals, for example, 148639610 + ... + 148646492.
It is an arithmetic number, because the mean of its divisors is an integer number (65013735120).
Almost surely, 21023110120033 is an apocalyptic number.
It is an amenable number.
1023110120033 is a deficient number, since it is larger than the sum of its proper divisors (17109641887).
1023110120033 is an equidigital number, since it uses as much as digits as its factorization.
1023110120033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10556.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1023110120033 its reverse (3300210113201), we get a palindrome (4323320233234).
The spelling of 1023110120033 in words is "one trillion, twenty-three billion, one hundred ten million, one hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •