Base | Representation |
---|---|
bin | 111010001100100… |
… | …0100110000000001 |
3 | 12001002101222010112 |
4 | 1310121010300001 |
5 | 12444344330423 |
6 | 521433441105 |
7 | 66250634465 |
oct | 16431046001 |
9 | 5032358115 |
10 | 1952730113 |
11 | 9122a1044 |
12 | 465b70195 |
13 | 251736809 |
14 | 1474b24a5 |
15 | b6676a78 |
hex | 74644c01 |
1952730113 has 2 divisors, whose sum is σ = 1952730114. Its totient is φ = 1952730112.
The previous prime is 1952730097. The next prime is 1952730119. The reversal of 1952730113 is 3110372591.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1711642384 + 241087729 = 41372^2 + 15527^2 .
It is an emirp because it is prime and its reverse (3110372591) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1952730113 - 24 = 1952730097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1952730113.
It is not a weakly prime, because it can be changed into another prime (1952730119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 976365056 + 976365057.
It is an arithmetic number, because the mean of its divisors is an integer number (976365057).
Almost surely, 21952730113 is an apocalyptic number.
It is an amenable number.
1952730113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1952730113 is an equidigital number, since it uses as much as digits as its factorization.
1952730113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 32.
The square root of 1952730113 is about 44189.7059619093. The cubic root of 1952730113 is about 1249.9157517619.
The spelling of 1952730113 in words is "one billion, nine hundred fifty-two million, seven hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •