Base | Representation |
---|---|
bin | 1011110101111111111101… |
… | …0111011111011011111101 |
3 | 1201002220220120202100122002 |
4 | 2331133333113133123331 |
5 | 3201324213014103313 |
6 | 43410213110432045 |
7 | 2512555324352405 |
oct | 275377727373375 |
9 | 51086816670562 |
10 | 13022330222333 |
11 | 4170814a122a3 |
12 | 1563994062625 |
13 | 73600105a423 |
14 | 3303d99a5805 |
15 | 178b19c94058 |
hex | bd7ff5df6fd |
13022330222333 has 8 divisors (see below), whose sum is σ = 13206613617216. Its totient is φ = 12838071002400.
The previous prime is 13022330222233. The next prime is 13022330222357. The reversal of 13022330222333 is 33322203322031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13022330222333 - 210 = 13022330221309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13022330222296 and 13022330222305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13022330222233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4957403 + ... + 7114808.
It is an arithmetic number, because the mean of its divisors is an integer number (1650826702152).
Almost surely, 213022330222333 is an apocalyptic number.
It is an amenable number.
13022330222333 is a deficient number, since it is larger than the sum of its proper divisors (184283394883).
13022330222333 is a wasteful number, since it uses less digits than its factorization.
13022330222333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12087475.
The product of its (nonzero) digits is 23328, while the sum is 29.
Adding to 13022330222333 its reverse (33322203322031), we get a palindrome (46344533544364).
The spelling of 13022330222333 in words is "thirteen trillion, twenty-two billion, three hundred thirty million, two hundred twenty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •