Base | Representation |
---|---|
bin | 1011111011110100011101… |
… | …0101111011011111100011 |
3 | 1201110111000011221222211122 |
4 | 2332331013111323133203 |
5 | 3204444003414122243 |
6 | 43524151142002455 |
7 | 2523025241540345 |
oct | 276750725733743 |
9 | 51414004858748 |
10 | 13122322020323 |
11 | 41aa16675607a |
12 | 157b23b11642b |
13 | 742577c577b9 |
14 | 3351a38cd295 |
15 | 17b51d40d668 |
hex | bef4757b7e3 |
13122322020323 has 8 divisors (see below), whose sum is σ = 13545749894016. Its totient is φ = 12698902094400.
The previous prime is 13122322020319. The next prime is 13122322020371. The reversal of 13122322020323 is 32302022322131.
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 13122322020323 - 22 = 13122322020319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13122322020292 and 13122322020301.
It is not an unprimeable number, because it can be changed into a prime (13122322020383) 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, 1463615 + ... + 5327927.
It is an arithmetic number, because the mean of its divisors is an integer number (1693218736752).
Almost surely, 213122322020323 is an apocalyptic number.
13122322020323 is a deficient number, since it is larger than the sum of its proper divisors (423427873693).
13122322020323 is a wasteful number, since it uses less digits than its factorization.
13122322020323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3973885.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 13122322020323 its reverse (32302022322131), we get a palindrome (45424344342454).
The spelling of 13122322020323 in words is "thirteen trillion, one hundred twenty-two billion, three hundred twenty-two million, twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •