Base | Representation |
---|---|
bin | 100001101010000… |
… | …1101001100000001 |
3 | 2220201002221220012 |
4 | 1003110031030001 |
5 | 4303104322434 |
6 | 304022154305 |
7 | 36662326661 |
oct | 10324151401 |
9 | 2821087805 |
10 | 1129370369 |
11 | 52a555746 |
12 | 276282995 |
13 | 14cc951ba |
14 | a9dc61a1 |
15 | 692383ce |
hex | 4350d301 |
1129370369 has 2 divisors, whose sum is σ = 1129370370. Its totient is φ = 1129370368.
The previous prime is 1129370329. The next prime is 1129370377. The reversal of 1129370369 is 9630739211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1121446144 + 7924225 = 33488^2 + 2815^2 .
It is an emirp because it is prime and its reverse (9630739211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1129370369 - 220 = 1128321793 is a prime.
It is a super-2 number, since 2×11293703692 = 2550954860750392322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1129370329) 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, 564685184 + 564685185.
It is an arithmetic number, because the mean of its divisors is an integer number (564685185).
Almost surely, 21129370369 is an apocalyptic number.
It is an amenable number.
1129370369 is a deficient number, since it is larger than the sum of its proper divisors (1).
1129370369 is an equidigital number, since it uses as much as digits as its factorization.
1129370369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 41.
The square root of 1129370369 is about 33606.1061267145. The cubic root of 1129370369 is about 1041.3869466944.
The spelling of 1129370369 in words is "one billion, one hundred twenty-nine million, three hundred seventy thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.595 sec. • engine limits •