Base | Representation |
---|---|
bin | 101111000000011101000… |
… | …100110111100011111011 |
3 | 102102210222101102010201111 |
4 | 233000131010313203323 |
5 | 410411130111101021 |
6 | 10511551504501151 |
7 | 452244632226115 |
oct | 57003504674373 |
9 | 12383871363644 |
10 | 3230303222011 |
11 | 1035a66a56108 |
12 | 44207a01a7b7 |
13 | 1a5801c9c678 |
14 | b24c17d43b5 |
15 | 5906323a8e1 |
hex | 2f01d1378fb |
3230303222011 has 2 divisors, whose sum is σ = 3230303222012. Its totient is φ = 3230303222010.
The previous prime is 3230303221967. The next prime is 3230303222023. The reversal of 3230303222011 is 1102223030323.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3230303222011 - 27 = 3230303221883 is a prime.
It is a super-2 number, since 2×32303032220112 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3230303222051) by changing a digit.
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 as a sum of consecutive naturals, namely, 1615151611005 + 1615151611006.
It is an arithmetic number, because the mean of its divisors is an integer number (1615151611006).
Almost surely, 23230303222011 is an apocalyptic number.
3230303222011 is a deficient number, since it is larger than the sum of its proper divisors (1).
3230303222011 is an equidigital number, since it uses as much as digits as its factorization.
3230303222011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 3230303222011 its reverse (1102223030323), we get a palindrome (4332526252334).
The spelling of 3230303222011 in words is "three trillion, two hundred thirty billion, three hundred three million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •