Base | Representation |
---|---|
bin | 11101101111101000001… |
… | …01011111110111110011 |
3 | 10121200222002200122122202 |
4 | 32313310011133313303 |
5 | 113221030044043443 |
6 | 2101300144453415 |
7 | 133560112324004 |
oct | 16676405376763 |
9 | 3550862618582 |
10 | 1022002331123 |
11 | 364479743a24 |
12 | 1460a261a26b |
13 | 754b3755897 |
14 | 376726331ab |
15 | 1b8b81a57b8 |
hex | edf415fdf3 |
1022002331123 has 4 divisors (see below), whose sum is σ = 1054970148288. Its totient is φ = 989034513960.
The previous prime is 1022002331113. The next prime is 1022002331137. The reversal of 1022002331123 is 3211332002201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1022002331123 - 24 = 1022002331107 is a prime.
It is a super-2 number, since 2×10220023311232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022002331095 and 1022002331104.
It is not an unprimeable number, because it can be changed into a prime (1022002331113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16483908536 + ... + 16483908597.
It is an arithmetic number, because the mean of its divisors is an integer number (263742537072).
Almost surely, 21022002331123 is an apocalyptic number.
1022002331123 is a deficient number, since it is larger than the sum of its proper divisors (32967817165).
1022002331123 is an equidigital number, since it uses as much as digits as its factorization.
1022002331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32967817164.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1022002331123 its reverse (3211332002201), we get a palindrome (4233334333324).
The spelling of 1022002331123 in words is "one trillion, twenty-two billion, two million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •