Base | Representation |
---|---|
bin | 101000011000010… |
… | …0011000110100001 |
3 | 10111102111020211111 |
4 | 1100300203012201 |
5 | 10233323411334 |
6 | 342240143321 |
7 | 45401331226 |
oct | 12060430641 |
9 | 3442436744 |
10 | 1354903969 |
11 | 635898451 |
12 | 319907b41 |
13 | 18791c533 |
14 | cbd3394d |
15 | 7de38064 |
hex | 50c231a1 |
1354903969 has 2 divisors, whose sum is σ = 1354903970. Its totient is φ = 1354903968.
The previous prime is 1354903943. The next prime is 1354903981. The reversal of 1354903969 is 9693094531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1202702400 + 152201569 = 34680^2 + 12337^2 .
It is a cyclic number.
It is not a de Polignac number, because 1354903969 - 25 = 1354903937 is a prime.
It is a super-2 number, since 2×13549039692 = 3671529530423905922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1354903909) 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, 677451984 + 677451985.
It is an arithmetic number, because the mean of its divisors is an integer number (677451985).
Almost surely, 21354903969 is an apocalyptic number.
It is an amenable number.
1354903969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1354903969 is an equidigital number, since it uses as much as digits as its factorization.
1354903969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 787320, while the sum is 49.
The square root of 1354903969 is about 36809.0202124425. The cubic root of 1354903969 is about 1106.5460825192.
The spelling of 1354903969 in words is "one billion, three hundred fifty-four million, nine hundred three thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •