Base | Representation |
---|---|
bin | 1011110101111111100011… |
… | …1111010110110100101101 |
3 | 1201002220122010102200220022 |
4 | 2331133320333112310231 |
5 | 3201324003121413201 |
6 | 43410154325331525 |
7 | 2512552555065203 |
oct | 275377077266455 |
9 | 51086563380808 |
10 | 13022223232301 |
11 | 417076a587088 |
12 | 1563964266ba5 |
13 | 735cb4b3a10a |
14 | 3303c96b5073 |
15 | 178b106ad41b |
hex | bd7f8fd6d2d |
13022223232301 has 4 divisors (see below), whose sum is σ = 13442294949504. Its totient is φ = 12602151515100.
The previous prime is 13022223232279. The next prime is 13022223232303. The reversal of 13022223232301 is 10323232222031.
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 13022223232301 - 238 = 12747345325357 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 (13022223232303) 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, 210035858555 + ... + 210035858616.
It is an arithmetic number, because the mean of its divisors is an integer number (3360573737376).
Almost surely, 213022223232301 is an apocalyptic number.
It is an amenable number.
13022223232301 is a deficient number, since it is larger than the sum of its proper divisors (420071717203).
13022223232301 is an equidigital number, since it uses as much as digits as its factorization.
13022223232301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 420071717202.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 13022223232301 its reverse (10323232222031), we get a palindrome (23345455454332).
The spelling of 13022223232301 in words is "thirteen trillion, twenty-two billion, two hundred twenty-three million, two hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •