Base | Representation |
---|---|
bin | 10010111100010001… |
… | …00111110111000001 |
3 | 222020201020121000121 |
4 | 21132020213313001 |
5 | 131311312101223 |
6 | 4401030220241 |
7 | 510001140562 |
oct | 113610476701 |
9 | 28221217017 |
10 | 10169253313 |
11 | 434930758a |
12 | 1b797b4681 |
13 | c60a9a96b |
14 | 6c6820169 |
15 | 3e7b9215d |
hex | 25e227dc1 |
10169253313 has 2 divisors, whose sum is σ = 10169253314. Its totient is φ = 10169253312.
The previous prime is 10169253293. The next prime is 10169253319. The reversal of 10169253313 is 31335296101.
It is a happy number.
10169253313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7474812849 + 2694440464 = 86457^2 + 51908^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10169253313 is a prime.
It is a super-2 number, since 2×101692533132 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10169253319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5084626656 + 5084626657.
It is an arithmetic number, because the mean of its divisors is an integer number (5084626657).
Almost surely, 210169253313 is an apocalyptic number.
It is an amenable number.
10169253313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10169253313 is an equidigital number, since it uses as much as digits as its factorization.
10169253313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 34.
The spelling of 10169253313 in words is "ten billion, one hundred sixty-nine million, two hundred fifty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •