Base | Representation |
---|---|
bin | 1010001010100100100100… |
… | …10111101110011010000001 |
3 | 2221010222012110000021002021 |
4 | 11011102102113232122001 |
5 | 10412214344132020223 |
6 | 115313012411321441 |
7 | 4464661466511412 |
oct | 505222227563201 |
9 | 87128173007067 |
10 | 22353465501313 |
11 | 7139062581641 |
12 | 2610302450281 |
13 | c61bcc3944cb |
14 | 573cb091b809 |
15 | 28b6e925c65d |
hex | 1454925ee681 |
22353465501313 has 4 divisors (see below), whose sum is σ = 22362555973680. Its totient is φ = 22344375028948.
The previous prime is 22353465501277. The next prime is 22353465501317. The reversal of 22353465501313 is 31310556435322.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22353465501313 - 241 = 20154442245761 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22353465501313.
It is not an unprimeable number, because it can be changed into a prime (22353465501317) 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, 4545232495 + ... + 4545237412.
It is an arithmetic number, because the mean of its divisors is an integer number (5590638993420).
Almost surely, 222353465501313 is an apocalyptic number.
It is an amenable number.
22353465501313 is a deficient number, since it is larger than the sum of its proper divisors (9090472367).
22353465501313 is an equidigital number, since it uses as much as digits as its factorization.
22353465501313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9090472366.
The product of its (nonzero) digits is 972000, while the sum is 43.
The spelling of 22353465501313 in words is "twenty-two trillion, three hundred fifty-three billion, four hundred sixty-five million, five hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •