Base | Representation |
---|---|
bin | 11101011001011110110… |
… | …00011010100111101011 |
3 | 10120120021110101122201010 |
4 | 32230233120122213223 |
5 | 113022202213303303 |
6 | 2052012242555003 |
7 | 132656344260366 |
oct | 16545730324753 |
9 | 3516243348633 |
10 | 1010112244203 |
11 | 35a428034707 |
12 | 143924668a63 |
13 | 7433a2c59aa |
14 | 36c654670dd |
15 | 1b41e3e6c03 |
hex | eb2f61a9eb |
1010112244203 has 8 divisors (see below), whose sum is σ = 1405373557248. Its totient is φ = 644129546984.
The previous prime is 1010112244087. The next prime is 1010112244277. The reversal of 1010112244203 is 3024422110101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010112244203 - 229 = 1009575373291 is a prime.
It is a super-2 number, since 2×10101122442032 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1010112244203.
It is not an unprimeable number, because it can be changed into a prime (1010112244283) 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, 7319653875 + ... + 7319654012.
It is an arithmetic number, because the mean of its divisors is an integer number (175671694656).
Almost surely, 21010112244203 is an apocalyptic number.
1010112244203 is a deficient number, since it is larger than the sum of its proper divisors (395261313045).
1010112244203 is a wasteful number, since it uses less digits than its factorization.
1010112244203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14639307913.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1010112244203 its reverse (3024422110101), we get a palindrome (4034534354304).
The spelling of 1010112244203 in words is "one trillion, ten billion, one hundred twelve million, two hundred forty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •