Base | Representation |
---|---|
bin | 10000001100100100000… |
… | …010101101110011010001 |
3 | 10221101211222011020112122 |
4 | 100030210002231303101 |
5 | 121213411303040304 |
6 | 2211150010504025 |
7 | 143261131166624 |
oct | 20144402556321 |
9 | 3841758136478 |
10 | 1113001221329 |
11 | 39a0261a0008 |
12 | 15b859a35015 |
13 | 80c564b6b4a |
14 | 3bc2606ddbb |
15 | 1de420949be |
hex | 103240adcd1 |
1113001221329 has 4 divisors (see below), whose sum is σ = 1128247813476. Its totient is φ = 1097754629184.
The previous prime is 1113001221307. The next prime is 1113001221337. The reversal of 1113001221329 is 9231221003111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 482541401104 + 630459820225 = 694652^2 + 794015^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1113001221329 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1113001221298 and 1113001221307.
It is not an unprimeable number, because it can be changed into a prime (1113001220329) 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, 7623295964 + ... + 7623296109.
It is an arithmetic number, because the mean of its divisors is an integer number (282061953369).
Almost surely, 21113001221329 is an apocalyptic number.
It is an amenable number.
1113001221329 is a deficient number, since it is larger than the sum of its proper divisors (15246592147).
1113001221329 is an equidigital number, since it uses as much as digits as its factorization.
1113001221329 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15246592146.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 1113001221329 in words is "one trillion, one hundred thirteen billion, one million, two hundred twenty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •