Base | Representation |
---|---|
bin | 100010000110010111110… |
… | …000011001001111000011 |
3 | 22022000110211102111020001 |
4 | 202012113300121033003 |
5 | 301343041111102321 |
6 | 4552255412300431 |
7 | 331204144513600 |
oct | 42062760311703 |
9 | 8260424374201 |
10 | 2343303222211 |
11 | 823875640936 |
12 | 31a193611717 |
13 | 13cc848b5393 |
14 | 815b8b776a7 |
15 | 40e4c160c91 |
hex | 22197c193c3 |
2343303222211 has 6 divisors (see below), whose sum is σ = 2725883340180. Its totient is φ = 2008545618996.
The previous prime is 2343303222199. The next prime is 2343303222229. The reversal of 2343303222211 is 1122223033432.
It is not a de Polignac number, because 2343303222211 - 223 = 2343294833603 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2343303222211.
It is not an unprimeable number, because it can be changed into a prime (2343303222251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 23911257321 + ... + 23911257418.
It is an arithmetic number, because the mean of its divisors is an integer number (454313890030).
Almost surely, 22343303222211 is an apocalyptic number.
2343303222211 is a deficient number, since it is larger than the sum of its proper divisors (382580117969).
2343303222211 is an equidigital number, since it uses as much as digits as its factorization.
2343303222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47822514753 (or 47822514746 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 2343303222211 its reverse (1122223033432), we get a palindrome (3465526255643).
The spelling of 2343303222211 in words is "two trillion, three hundred forty-three billion, three hundred three million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •