Base | Representation |
---|---|
bin | 11000110100000110… |
… | …11110110110110011 |
3 | 1021101102201212001012 |
4 | 30122003132312303 |
5 | 204240414203243 |
6 | 10041533101135 |
7 | 651063215141 |
oct | 143203366663 |
9 | 37342655035 |
10 | 13322022323 |
11 | 5716a30605 |
12 | 26b96277ab |
13 | 134401055c |
14 | 905432591 |
15 | 52e860d18 |
hex | 31a0dedb3 |
13322022323 has 4 divisors (see below), whose sum is σ = 13322253288. Its totient is φ = 13321791360.
The previous prime is 13322022313. The next prime is 13322022347. The reversal of 13322022323 is 32322022331.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 32322022331 = 727 ⋅44459453.
It is a cyclic number.
It is not a de Polignac number, because 13322022323 - 222 = 13317828019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13322022313) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 52115 + ... + 171347.
It is an arithmetic number, because the mean of its divisors is an integer number (3330563322).
Almost surely, 213322022323 is an apocalyptic number.
13322022323 is a deficient number, since it is larger than the sum of its proper divisors (230965).
13322022323 is a wasteful number, since it uses less digits than its factorization.
13322022323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230964.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 13322022323 its reverse (32322022331), we get a palindrome (45644044654).
The spelling of 13322022323 in words is "thirteen billion, three hundred twenty-two million, twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •