Base | Representation |
---|---|
bin | 111010100001110010101… |
… | …010111000000001110111 |
3 | 112020111112000110201020021 |
4 | 322201302222320001313 |
5 | 1011344040341344343 |
6 | 12315404245550011 |
7 | 563403144246601 |
oct | 72416252700167 |
9 | 15214460421207 |
10 | 4022013231223 |
11 | 13107a9685049 |
12 | 54b5b0115307 |
13 | 232374600c40 |
14 | dc948b66171 |
15 | 6e94d84e0ed |
hex | 3a872ab8077 |
4022013231223 has 8 divisors (see below), whose sum is σ = 4332047468000. Its totient is φ = 3712071652128.
The previous prime is 4022013231161. The next prime is 4022013231241. The reversal of 4022013231223 is 3221323102204.
4022013231223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4022013231223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4022013241223) 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, 23074248 + ... + 23247901.
It is an arithmetic number, because the mean of its divisors is an integer number (541505933500).
Almost surely, 24022013231223 is an apocalyptic number.
4022013231223 is a deficient number, since it is larger than the sum of its proper divisors (310034236777).
4022013231223 is a wasteful number, since it uses less digits than its factorization.
4022013231223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46328841.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 4022013231223 its reverse (3221323102204), we get a palindrome (7243336333427).
The spelling of 4022013231223 in words is "four trillion, twenty-two billion, thirteen million, two hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.473 sec. • engine limits •