Base | Representation |
---|---|
bin | 10000010011000111001… |
… | …011101101000101101101 |
3 | 10222002000001010100122011 |
4 | 100103013023231011231 |
5 | 121322312001344323 |
6 | 2214311451121221 |
7 | 143630316245311 |
oct | 20230713550555 |
9 | 3862001110564 |
10 | 1120033231213 |
11 | 3a2004618126 |
12 | 1610a0a43211 |
13 | 81807319840 |
14 | 3c2d1d5db41 |
15 | 1e2045d320d |
hex | 104c72ed16d |
1120033231213 has 8 divisors (see below), whose sum is σ = 1206232640928. Its totient is φ = 1033839965424.
The previous prime is 1120033231193. The next prime is 1120033231217. The reversal of 1120033231213 is 3121323300211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1120033231213 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 (1120033231217) 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, 1153831 + ... + 1889812.
It is an arithmetic number, because the mean of its divisors is an integer number (150779080116).
Almost surely, 21120033231213 is an apocalyptic number.
1120033231213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1120033231213 is a deficient number, since it is larger than the sum of its proper divisors (86199409715).
1120033231213 is a wasteful number, since it uses less digits than its factorization.
1120033231213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3071963.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1120033231213 its reverse (3121323300211), we get a palindrome (4241356531424).
The spelling of 1120033231213 in words is "one trillion, one hundred twenty billion, thirty-three million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •