Base | Representation |
---|---|
bin | 11101111110110000000… |
… | …11101010010101000011 |
3 | 10122110220222022200212022 |
4 | 32333120003222111003 |
5 | 113334142214202321 |
6 | 2105122001552055 |
7 | 134265245500532 |
oct | 16773003522503 |
9 | 3573828280768 |
10 | 1030122022211 |
11 | 367966032027 |
12 | 14778994562b |
13 | 761a8a15119 |
14 | 37c02b76319 |
15 | 1bbe0e44dab |
hex | efd80ea543 |
1030122022211 has 8 divisors (see below), whose sum is σ = 1055414105424. Its totient is φ = 1004837898880.
The previous prime is 1030122022201. The next prime is 1030122022213. The reversal of 1030122022211 is 1122202210301.
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 1030122022211 - 214 = 1030122005827 is a prime.
It is a super-2 number, since 2×10301220222112 (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 1030122022211.
It is not an unprimeable number, because it can be changed into a prime (1030122022213) 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, 1727546 + ... + 2246031.
It is an arithmetic number, because the mean of its divisors is an integer number (131926763178).
Almost surely, 21030122022211 is an apocalyptic number.
1030122022211 is a deficient number, since it is larger than the sum of its proper divisors (25292083213).
1030122022211 is an equidigital number, since it uses as much as digits as its factorization.
1030122022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3979941.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1030122022211 its reverse (1122202210301), we get a palindrome (2152324232512).
The spelling of 1030122022211 in words is "one trillion, thirty billion, one hundred twenty-two million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.998 sec. • engine limits •