Base | Representation |
---|---|
bin | 10000001100110111001… |
… | …111000001000111110100 |
3 | 10221102200102001010111012 |
4 | 100030313033001013310 |
5 | 121220041220311200 |
6 | 2211241552131352 |
7 | 143302121113004 |
oct | 20146717010764 |
9 | 3842612033435 |
10 | 1113323213300 |
11 | 39a180a25381 |
12 | 15b929836b58 |
13 | 80ca811493c |
14 | 3bc56b2a004 |
15 | 1de60499a35 |
hex | 103373c11f4 |
1113323213300 has 72 divisors (see below), whose sum is σ = 2546940693696. Its totient is φ = 421575644160.
The previous prime is 1113323213279. The next prime is 1113323213309. The reversal of 1113323213300 is 33123233111.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113323213309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2272022 + ... + 2718221.
Almost surely, 21113323213300 is an apocalyptic number.
1113323213300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113323213300 is an abundant number, since it is smaller than the sum of its proper divisors (1433617480396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113323213300 is a wasteful number, since it uses less digits than its factorization.
1113323213300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4990377 (or 4990370 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1113323213300 its reverse (33123233111), we get a palindrome (1146446446411).
The spelling of 1113323213300 in words is "one trillion, one hundred thirteen billion, three hundred twenty-three million, two hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •