Base | Representation |
---|---|
bin | 111010011010100010010… |
… | …010100100001100110011 |
3 | 112012202102001022212012101 |
4 | 322122202102210030303 |
5 | 1011232111342332243 |
6 | 12312035213441231 |
7 | 563006111654344 |
oct | 72324222441463 |
9 | 15182361285171 |
10 | 4014222230323 |
11 | 1308470886828 |
12 | 549b96aa0217 |
13 | 231702476236 |
14 | dc40a1440cb |
15 | 6e64488954d |
hex | 3a6a24a4333 |
4014222230323 has 2 divisors, whose sum is σ = 4014222230324. Its totient is φ = 4014222230322.
The previous prime is 4014222230309. The next prime is 4014222230363. The reversal of 4014222230323 is 3230322224104.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4014222230323 is a prime.
It is a super-2 number, since 2×40142222303232 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4014222230291 and 4014222230300.
It is not a weakly prime, because it can be changed into another prime (4014222230303) 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 as a sum of consecutive naturals, namely, 2007111115161 + 2007111115162.
It is an arithmetic number, because the mean of its divisors is an integer number (2007111115162).
Almost surely, 24014222230323 is an apocalyptic number.
4014222230323 is a deficient number, since it is larger than the sum of its proper divisors (1).
4014222230323 is an equidigital number, since it uses as much as digits as its factorization.
4014222230323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 4014222230323 its reverse (3230322224104), we get a palindrome (7244544454427).
The spelling of 4014222230323 in words is "four trillion, fourteen billion, two hundred twenty-two million, two hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •