Base | Representation |
---|---|
bin | 11101110001100100001… |
… | …01000010111111011100 |
3 | 10121210122120202122020102 |
4 | 32320302011002333130 |
5 | 113230142323301340 |
6 | 2101551301040232 |
7 | 133624641631301 |
oct | 16706205027734 |
9 | 3553576678212 |
10 | 1023042400220 |
11 | 364962845265 |
12 | 1463329b6078 |
13 | 7561b081b99 |
14 | 377308110a8 |
15 | 1b92964e215 |
hex | ee32142fdc |
1023042400220 has 24 divisors (see below), whose sum is σ = 2148872337024. Its totient is φ = 409124903616.
The previous prime is 1023042400199. The next prime is 1023042400231. The reversal of 1023042400220 is 220042403201.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1023042400192 and 1023042400201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5662367 + ... + 5840246.
It is an arithmetic number, because the mean of its divisors is an integer number (89536347376).
Almost surely, 21023042400220 is an apocalyptic number.
1023042400220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1023042400220 is an abundant number, since it is smaller than the sum of its proper divisors (1125829936804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023042400220 is a wasteful number, since it uses less digits than its factorization.
1023042400220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11507069 (or 11507067 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 1023042400220 its reverse (220042403201), we get a palindrome (1243084803421).
The spelling of 1023042400220 in words is "one trillion, twenty-three billion, forty-two million, four hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •