Base | Representation |
---|---|
bin | 10000010101111101111… |
… | …110100111010100000101 |
3 | 10222100220202211212222022 |
4 | 100111331332213110011 |
5 | 121400102101431323 |
6 | 2215540043212525 |
7 | 144066315513260 |
oct | 20257576472405 |
9 | 3870822755868 |
10 | 1123100030213 |
11 | 3a3338762657 |
12 | 1617b7b17145 |
13 | 81ba57bb8c5 |
14 | 3c503393cd7 |
15 | 1e33396e4c8 |
hex | 1057dfa7505 |
1123100030213 has 16 divisors (see below), whose sum is σ = 1290510485376. Its totient is φ = 957433927680.
The previous prime is 1123100030201. The next prime is 1123100030249. The reversal of 1123100030213 is 3120300013211.
It is a cyclic number.
It is not a de Polignac number, because 1123100030213 - 26 = 1123100030149 is a prime.
It is a super-2 number, since 2×11231000302132 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1123100030191 and 1123100030200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123100030813) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5510618 + ... + 5710788.
It is an arithmetic number, because the mean of its divisors is an integer number (80656905336).
Almost surely, 21123100030213 is an apocalyptic number.
It is an amenable number.
1123100030213 is a deficient number, since it is larger than the sum of its proper divisors (167410455163).
1123100030213 is a wasteful number, since it uses less digits than its factorization.
1123100030213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204524.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1123100030213 its reverse (3120300013211), we get a palindrome (4243400043424).
The spelling of 1123100030213 in words is "one trillion, one hundred twenty-three billion, one hundred million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •