Base | Representation |
---|---|
bin | 100001101010000… |
… | …1101001100001101 |
3 | 2220201002221220122 |
4 | 1003110031030031 |
5 | 4303104323011 |
6 | 304022154325 |
7 | 36662330006 |
oct | 10324151415 |
9 | 2821087818 |
10 | 1129370381 |
11 | 52a555757 |
12 | 2762829a5 |
13 | 14cc951c9 |
14 | a9dc61ad |
15 | 692383db |
hex | 4350d30d |
1129370381 has 2 divisors, whose sum is σ = 1129370382. Its totient is φ = 1129370380.
The previous prime is 1129370377. The next prime is 1129370441. The reversal of 1129370381 is 1830739211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1112222500 + 17147881 = 33350^2 + 4141^2 .
It is a cyclic number.
It is not a de Polignac number, because 1129370381 - 22 = 1129370377 is a prime.
It is a super-3 number, since 3×11293703813 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1129370581) 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 as a sum of consecutive naturals, namely, 564685190 + 564685191.
It is an arithmetic number, because the mean of its divisors is an integer number (564685191).
Almost surely, 21129370381 is an apocalyptic number.
It is an amenable number.
1129370381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1129370381 is an equidigital number, since it uses as much as digits as its factorization.
1129370381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 35.
The square root of 1129370381 is about 33606.1063052535. The cubic root of 1129370381 is about 1041.3869503828.
The spelling of 1129370381 in words is "one billion, one hundred twenty-nine million, three hundred seventy thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •