Base | Representation |
---|---|
bin | 110100101010101011… |
… | …1001110110011110111 |
3 | 101210221020001111100022 |
4 | 1221111113032303313 |
5 | 3323112413144111 |
6 | 123542533235355 |
7 | 11112520133153 |
oct | 1512527166367 |
9 | 353836044308 |
10 | 113101303031 |
11 | 43a69811a72 |
12 | 19b05492b5b |
13 | a885b90062 |
14 | 568d03a063 |
15 | 2e1e4ec2db |
hex | 1a555cecf7 |
113101303031 has 4 divisors (see below), whose sum is σ = 114102199632. Its totient is φ = 112100406432.
The previous prime is 113101302967. The next prime is 113101303033. The reversal of 113101303031 is 130303101311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113101303031 - 26 = 113101302967 is a prime.
It is a super-2 number, since 2×1131013030312 (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 (113101303033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500448131 + ... + 500448356.
It is an arithmetic number, because the mean of its divisors is an integer number (28525549908).
Almost surely, 2113101303031 is an apocalyptic number.
113101303031 is a deficient number, since it is larger than the sum of its proper divisors (1000896601).
113101303031 is a wasteful number, since it uses less digits than its factorization.
113101303031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000896600.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 113101303031 its reverse (130303101311), we get a palindrome (243404404342).
The spelling of 113101303031 in words is "one hundred thirteen billion, one hundred one million, three hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.498 sec. • engine limits •