Base | Representation |
---|---|
bin | 11101110000001101000… |
… | …11111100100110100011 |
3 | 10121201202200221212011001 |
4 | 32320012203330212203 |
5 | 113222143422144021 |
6 | 2101351020332431 |
7 | 133600565125066 |
oct | 16700643744643 |
9 | 3551680855131 |
10 | 1022312303011 |
11 | 36461870943a |
12 | 14616a3a4117 |
13 | 75532a354bc |
14 | 376a18808dd |
15 | 1b8d54d4091 |
hex | ee068fc9a3 |
1022312303011 has 4 divisors (see below), whose sum is σ = 1022346885352. Its totient is φ = 1022277720672.
The previous prime is 1022312303009. The next prime is 1022312303027. The reversal of 1022312303011 is 1103032132201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1022312303011 - 21 = 1022312303009 is a prime.
It is a super-2 number, since 2×10223123030112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1022312303011.
It is not an unprimeable number, because it can be changed into a prime (1022312303081) 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, 17246790 + ... + 17305963.
It is an arithmetic number, because the mean of its divisors is an integer number (255586721338).
Almost surely, 21022312303011 is an apocalyptic number.
1022312303011 is a deficient number, since it is larger than the sum of its proper divisors (34582341).
1022312303011 is an equidigital number, since it uses as much as digits as its factorization.
1022312303011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34582340.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1022312303011 its reverse (1103032132201), we get a palindrome (2125344435212).
The spelling of 1022312303011 in words is "one trillion, twenty-two billion, three hundred twelve million, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •