Base | Representation |
---|---|
bin | 1010000001101111010111… |
… | …10000000001010100110111 |
3 | 2220001221221222012202112102 |
4 | 11000313223300001110313 |
5 | 10342231421211130341 |
6 | 114521350200012315 |
7 | 4434030052430153 |
oct | 500675360012467 |
9 | 86057858182472 |
10 | 22050022364471 |
11 | 70313a8866702 |
12 | 2581537a6109b |
13 | c3c40111852a |
14 | 5633263c0063 |
15 | 283889674c9b |
hex | 140debc01537 |
22050022364471 has 4 divisors (see below), whose sum is σ = 22154524840344. Its totient is φ = 21945519888600.
The previous prime is 22050022364453. The next prime is 22050022364477. The reversal of 22050022364471 is 17446322005022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22050022364471 - 226 = 22049955255607 is a prime.
It is a super-3 number, since 3×220500223644713 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22050022364477) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52251237620 + ... + 52251238041.
It is an arithmetic number, because the mean of its divisors is an integer number (5538631210086).
Almost surely, 222050022364471 is an apocalyptic number.
22050022364471 is a deficient number, since it is larger than the sum of its proper divisors (104502475873).
22050022364471 is a wasteful number, since it uses less digits than its factorization.
22050022364471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104502475872.
The product of its (nonzero) digits is 161280, while the sum is 38.
Adding to 22050022364471 its reverse (17446322005022), we get a palindrome (39496344369493).
The spelling of 22050022364471 in words is "twenty-two trillion, fifty billion, twenty-two million, three hundred sixty-four thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •