Base | Representation |
---|---|
bin | 1010011010100111100110… |
… | …11110100110010101100101 |
3 | 10000002200102102011201201121 |
4 | 11031103303132212111211 |
5 | 11000233113212211414 |
6 | 120414202033453541 |
7 | 4552551355646434 |
oct | 515236336462545 |
9 | 100080372151647 |
10 | 22904850507109 |
11 | 733098aa8a47a |
12 | 269b1441112b1 |
13 | ca1bc21b094c |
14 | 59285a39d11b |
15 | 29ac1b117724 |
hex | 14d4f37a6565 |
22904850507109 has 16 divisors (see below), whose sum is σ = 24259982608368. Its totient is φ = 21550585019392.
The previous prime is 22904850507103. The next prime is 22904850507127. The reversal of 22904850507109 is 90170505840922.
It can be written as a sum of positive squares in 8 ways, for example, as 6430002705025 + 16474847802084 = 2535745^2 + 4058922^2 .
It is a cyclic number.
It is not a de Polignac number, because 22904850507109 - 213 = 22904850498917 is a prime.
It is a super-2 number, since 2×229048505071092 (a number of 28 digits) contains 22 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 (22904850507103) 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, 914827539 + ... + 914852575.
It is an arithmetic number, because the mean of its divisors is an integer number (1516248913023).
Almost surely, 222904850507109 is an apocalyptic number.
It is an amenable number.
22904850507109 is a deficient number, since it is larger than the sum of its proper divisors (1355132101259).
22904850507109 is a wasteful number, since it uses less digits than its factorization.
22904850507109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40184.
The product of its (nonzero) digits is 1814400, while the sum is 52.
The spelling of 22904850507109 in words is "twenty-two trillion, nine hundred four billion, eight hundred fifty million, five hundred seven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •