Base | Representation |
---|---|
bin | 111101011111111111000… |
… | …100111001100001001111 |
3 | 112222000122101201122000110 |
4 | 331133333010321201033 |
5 | 1023220310433414343 |
6 | 12553300533531103 |
7 | 614222656024245 |
oct | 75377704714117 |
9 | 15860571648013 |
10 | 4226232326223 |
11 | 138a375a74816 |
12 | 5830a47a3a93 |
13 | 2486bba5331b |
14 | 10879d310795 |
15 | 74e023c5833 |
hex | 3d7ff13984f |
4226232326223 has 16 divisors (see below), whose sum is σ = 5642429184000. Its totient is φ = 2813762723040.
The previous prime is 4226232326189. The next prime is 4226232326233. The reversal of 4226232326223 is 3226232326224.
4226232326223 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4226232326223 - 214 = 4226232309839 is a prime.
It is a super-2 number, since 2×42262323262232 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4226232326233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19902018 + ... + 20113248.
It is an arithmetic number, because the mean of its divisors is an integer number (352651824000).
Almost surely, 24226232326223 is an apocalyptic number.
4226232326223 is a deficient number, since it is larger than the sum of its proper divisors (1416196857777).
4226232326223 is a wasteful number, since it uses less digits than its factorization.
4226232326223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220022.
The product of its digits is 497664, while the sum is 39.
Subtracting from 4226232326223 its reverse (3226232326224), we obtain a palindrome (999999999999).
The spelling of 4226232326223 in words is "four trillion, two hundred twenty-six billion, two hundred thirty-two million, three hundred twenty-six thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •