Base | Representation |
---|---|
bin | 11101101110100001101… |
… | …10100110101001000101 |
3 | 10121122102220102022022021 |
4 | 32313100312212221011 |
5 | 113213322233133013 |
6 | 2101121351203141 |
7 | 133536344104006 |
oct | 16672066465105 |
9 | 3548386368267 |
10 | 1021411224133 |
11 | 3641a600a553 |
12 | 145b586764b1 |
13 | 7541b151a31 |
14 | 37617d231ad |
15 | 1b881342a8d |
hex | edd0da6a45 |
1021411224133 has 8 divisors (see below), whose sum is σ = 1023281138880. Its totient is φ = 1019542891680.
The previous prime is 1021411224091. The next prime is 1021411224143. The reversal of 1021411224133 is 3314221141201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1021411224133 - 29 = 1021411223621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021411224098 and 1021411224107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021411224143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 900538 + ... + 1689316.
It is an arithmetic number, because the mean of its divisors is an integer number (127910142360).
Almost surely, 21021411224133 is an apocalyptic number.
It is an amenable number.
1021411224133 is a deficient number, since it is larger than the sum of its proper divisors (1869914747).
1021411224133 is an equidigital number, since it uses as much as digits as its factorization.
1021411224133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 791147.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1021411224133 its reverse (3314221141201), we get a palindrome (4335632365334).
The spelling of 1021411224133 in words is "one trillion, twenty-one billion, four hundred eleven million, two hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •