Base | Representation |
---|---|
bin | 10000001100110111000… |
… | …110100111001101010000 |
3 | 10221102200020220012010111 |
4 | 100030313012213031100 |
5 | 121220040134310000 |
6 | 2211241433011104 |
7 | 143302063305253 |
oct | 20146706471520 |
9 | 3842606805114 |
10 | 1113321010000 |
11 | 39a17a75aa71 |
12 | 15b928b53a94 |
13 | 80ca7822b04 |
14 | 3bc5671509a |
15 | 1de601b1cba |
hex | 103371a7350 |
1113321010000 has 50 divisors (see below), whose sum is σ = 2695461521522. Its totient is φ = 445328400000.
The previous prime is 1113321009967. The next prime is 1113321010003. The reversal of 1113321010000 is 101233111.
It can be written as a sum of positive squares in 5 ways, for example, as 243518562576 + 869802447424 = 493476^2 + 932632^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113321010003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 55656051 + ... + 55676050.
Almost surely, 21113321010000 is an apocalyptic number.
1113321010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113321010000 is an abundant number, since it is smaller than the sum of its proper divisors (1582140511522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113321010000 is an equidigital number, since it uses as much as digits as its factorization.
1113321010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111332129 (or 111332108 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1113321010000 its reverse (101233111), we get a palindrome (1113422243111).
The spelling of 1113321010000 in words is "one trillion, one hundred thirteen billion, three hundred twenty-one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •