Base | Representation |
---|---|
bin | 11101110001100010110… |
… | …01111110100110000100 |
3 | 10121210121210112000222212 |
4 | 32320301121332212010 |
5 | 113230131431010040 |
6 | 2101550215042552 |
7 | 133624443646253 |
oct | 16706131764604 |
9 | 3553553460885 |
10 | 1023031110020 |
11 | 364957433817 |
12 | 14632b070458 |
13 | 7561892acaa |
14 | 3772d11279a |
15 | 1b92866dd65 |
hex | ee3167e984 |
1023031110020 has 48 divisors (see below), whose sum is σ = 2207195509680. Its totient is φ = 398014377984.
The previous prime is 1023031110007. The next prime is 1023031110037. The reversal of 1023031110020 is 200111303201.
It can be written as a sum of positive squares in 8 ways, for example, as 5970961984 + 1017060148036 = 77272^2 + 1008494^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1023031109977 and 1023031110004.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1905176 + ... + 2382384.
It is an arithmetic number, because the mean of its divisors is an integer number (45983239785).
Almost surely, 21023031110020 is an apocalyptic number.
1023031110020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1023031110020 is an abundant number, since it is smaller than the sum of its proper divisors (1184164399660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023031110020 is a wasteful number, since it uses less digits than its factorization.
1023031110020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 480152 (or 480150 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1023031110020 its reverse (200111303201), we get a palindrome (1223142413221).
The spelling of 1023031110020 in words is "one trillion, twenty-three billion, thirty-one million, one hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •