Base | Representation |
---|---|
bin | 101111000010010101… |
… | …1010101101011100001 |
3 | 100122201120111212221011 |
4 | 1132010223111223201 |
5 | 3123332102420223 |
6 | 114223051100521 |
7 | 10204061354560 |
oct | 1360453255341 |
9 | 318646455834 |
10 | 101010201313 |
11 | 3992469731a |
12 | 176b0141741 |
13 | 96a9babcb8 |
14 | 4c632a5bd7 |
15 | 2962c8380d |
hex | 1784ad5ae1 |
101010201313 has 8 divisors (see below), whose sum is σ = 115681236480. Its totient is φ = 86399417760.
The previous prime is 101010201301. The next prime is 101010201319. The reversal of 101010201313 is 313102010101.
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 101010201313 - 221 = 101008104161 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101010201293 and 101010201302.
It is not an unprimeable number, because it can be changed into a prime (101010201319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15059308 + ... + 15066013.
It is an arithmetic number, because the mean of its divisors is an integer number (14460154560).
Almost surely, 2101010201313 is an apocalyptic number.
It is an amenable number.
101010201313 is a deficient number, since it is larger than the sum of its proper divisors (14671035167).
101010201313 is an equidigital number, since it uses as much as digits as its factorization.
101010201313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30125807.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 101010201313 its reverse (313102010101), we get a palindrome (414112211414).
The spelling of 101010201313 in words is "one hundred one billion, ten million, two hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •