Base | Representation |
---|---|
bin | 10110111110001011100010… |
… | …101001110000000010110110 |
3 | 111020201101011000221020122211 |
4 | 112332023202221300002312 |
5 | 101220233441433111042 |
6 | 554512315121244034 |
7 | 30165115106044441 |
oct | 2676134251600266 |
9 | 436641130836584 |
10 | 101030023332022 |
11 | 2a211657361864 |
12 | b3b836649361a |
13 | 444b1235857b5 |
14 | 1ad3c44818658 |
15 | ba3051c1d017 |
hex | 5be2e2a700b6 |
101030023332022 has 8 divisors (see below), whose sum is σ = 151545913432200. Its totient is φ = 50514718854624.
The previous prime is 101030023332019. The next prime is 101030023332157. The reversal of 101030023332022 is 220233320030101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1010300233320222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101030023331984 and 101030023332002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145974147 + ... + 146664622.
It is an arithmetic number, because the mean of its divisors is an integer number (18943239179025).
Almost surely, 2101030023332022 is an apocalyptic number.
101030023332022 is a deficient number, since it is larger than the sum of its proper divisors (50515890100178).
101030023332022 is a wasteful number, since it uses less digits than its factorization.
101030023332022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292811390.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 101030023332022 its reverse (220233320030101), we get a palindrome (321263343362123).
The spelling of 101030023332022 in words is "one hundred one trillion, thirty billion, twenty-three million, three hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •