Base | Representation |
---|---|
bin | 1000100111100100… |
… | …1100000010010101 |
3 | 12222020012110100211 |
4 | 2021321030002111 |
5 | 14214222020401 |
6 | 1021321405421 |
7 | 111221112535 |
oct | 21171140225 |
9 | 5866173324 |
10 | 2313470101 |
11 | a87991368 |
12 | 546939871 |
13 | 2ab3b0327 |
14 | 17d3774c5 |
15 | d8182951 |
hex | 89e4c095 |
2313470101 has 4 divisors (see below), whose sum is σ = 2323069804. Its totient is φ = 2303870400.
The previous prime is 2313470057. The next prime is 2313470113. The reversal of 2313470101 is 1010743132.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1294200625 + 1019269476 = 35975^2 + 31926^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2313470101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313470171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4799490 + ... + 4799971.
It is an arithmetic number, because the mean of its divisors is an integer number (580767451).
Almost surely, 22313470101 is an apocalyptic number.
It is an amenable number.
2313470101 is a deficient number, since it is larger than the sum of its proper divisors (9599703).
2313470101 is an equidigital number, since it uses as much as digits as its factorization.
2313470101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9599702.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 2313470101 is about 48098.5457264562. The cubic root of 2313470101 is about 1322.5780083416.
The spelling of 2313470101 in words is "two billion, three hundred thirteen million, four hundred seventy thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •