Base | Representation |
---|---|
bin | 10000000001101011111… |
… | …101111000010011100101 |
3 | 10220021201002112201001022 |
4 | 100001223331320103211 |
5 | 121021002142330201 |
6 | 2201535114140525 |
7 | 142365545065232 |
oct | 20015375702345 |
9 | 3807632481038 |
10 | 1101323011301 |
11 | 395083145a67 |
12 | 15953aa21745 |
13 | 7cb14c0c1b6 |
14 | 3b439098789 |
15 | 1d9abbd941b |
hex | 1006bf784e5 |
1101323011301 has 16 divisors (see below), whose sum is σ = 1183740300288. Its totient is φ = 1022067446400.
The previous prime is 1101323011297. The next prime is 1101323011309. The reversal of 1101323011301 is 1031103231011.
It is a cyclic number.
It is not a de Polignac number, because 1101323011301 - 22 = 1101323011297 is a prime.
It is a super-2 number, since 2×11013230113012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1101323011301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101323011309) 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, 3055541 + ... + 3396906.
It is an arithmetic number, because the mean of its divisors is an integer number (73983768768).
Almost surely, 21101323011301 is an apocalyptic number.
It is an amenable number.
1101323011301 is a deficient number, since it is larger than the sum of its proper divisors (82417288987).
1101323011301 is a wasteful number, since it uses less digits than its factorization.
1101323011301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6452692.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1101323011301 its reverse (1031103231011), we get a palindrome (2132426242312).
The spelling of 1101323011301 in words is "one trillion, one hundred one billion, three hundred twenty-three million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •