Base | Representation |
---|---|
bin | 11110000100010101110… |
… | …00111001001001111110 |
3 | 10122202200001220200002111 |
4 | 33002022320321021332 |
5 | 113411313303233042 |
6 | 2110335420444234 |
7 | 134432506556431 |
oct | 17021270711176 |
9 | 3582601820074 |
10 | 1033122321022 |
11 | 369165686a20 |
12 | 1482866a967a |
13 | 765664a266c |
14 | 38009419818 |
15 | 1bd19547517 |
hex | f08ae3927e |
1033122321022 has 8 divisors (see below), whose sum is σ = 1690563798072. Its totient is φ = 469601055000.
The previous prime is 1033122321017. The next prime is 1033122321037. The reversal of 1033122321022 is 2201232213301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 46960105501 = 1033122321022 / (1 + 0 + 3 + 3 + 1 + 2 + 2 + 3 + 2 + 1 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1033122320984 and 1033122321002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23480052729 + ... + 23480052772.
It is an arithmetic number, because the mean of its divisors is an integer number (211320474759).
Almost surely, 21033122321022 is an apocalyptic number.
1033122321022 is a deficient number, since it is larger than the sum of its proper divisors (657441477050).
1033122321022 is a wasteful number, since it uses less digits than its factorization.
1033122321022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46960105514.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1033122321022 its reverse (2201232213301), we get a palindrome (3234354534323).
The spelling of 1033122321022 in words is "one trillion, thirty-three billion, one hundred twenty-two million, three hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •