Base | Representation |
---|---|
bin | 1010001100110011100010… |
… | …00100100101000001010111 |
3 | 2221102022022100002000211020 |
4 | 11012121301010211001113 |
5 | 10414444040324322320 |
6 | 115412144334212223 |
7 | 4503346445204463 |
oct | 506316104450127 |
9 | 87368270060736 |
10 | 22430216245335 |
11 | 71686683525a8 |
12 | 2623162054073 |
13 | c692112a2c42 |
14 | 5778b1d294a3 |
15 | 28d6dc34d940 |
hex | 146671125057 |
22430216245335 has 8 divisors (see below), whose sum is σ = 35888345992560. Its totient is φ = 11962781997504.
The previous prime is 22430216245267. The next prime is 22430216245351. The reversal of 22430216245335 is 53354261203422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22430216245335 - 29 = 22430216244823 is a prime.
It is a super-2 number, since 2×224302162453352 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 747673874830 + ... + 747673874859.
It is an arithmetic number, because the mean of its divisors is an integer number (4486043249070).
Almost surely, 222430216245335 is an apocalyptic number.
22430216245335 is a deficient number, since it is larger than the sum of its proper divisors (13458129747225).
22430216245335 is a wasteful number, since it uses less digits than its factorization.
22430216245335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495347749697.
The product of its (nonzero) digits is 1036800, while the sum is 42.
Adding to 22430216245335 its reverse (53354261203422), we get a palindrome (75784477448757).
The spelling of 22430216245335 in words is "twenty-two trillion, four hundred thirty billion, two hundred sixteen million, two hundred forty-five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •