Base | Representation |
---|---|
bin | 110100110111011111… |
… | …1001111010100110101 |
3 | 101212001012000121100012 |
4 | 1221232333033110311 |
5 | 3330002443040201 |
6 | 124053332030005 |
7 | 11126260313201 |
oct | 1515677172465 |
9 | 355035017305 |
10 | 113531221301 |
11 | 4416a461a23 |
12 | 1a005462305 |
13 | a923c78374 |
14 | 56d018bb01 |
15 | 2e471205bb |
hex | 1a6efcf535 |
113531221301 has 4 divisors (see below), whose sum is σ = 114633466272. Its totient is φ = 112428976332.
The previous prime is 113531221277. The next prime is 113531221313. The reversal of 113531221301 is 103122135311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113531221301 is a prime.
It is a super-2 number, since 2×1135312213012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113531220301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 551122331 + ... + 551122536.
It is an arithmetic number, because the mean of its divisors is an integer number (28658366568).
Almost surely, 2113531221301 is an apocalyptic number.
It is an amenable number.
113531221301 is a deficient number, since it is larger than the sum of its proper divisors (1102244971).
113531221301 is a wasteful number, since it uses less digits than its factorization.
113531221301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1102244970.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 113531221301 its reverse (103122135311), we get a palindrome (216653356612).
The spelling of 113531221301 in words is "one hundred thirteen billion, five hundred thirty-one million, two hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •