Base | Representation |
---|---|
bin | 11001111001100101… |
… | …10011010000000001 |
3 | 1022220001102200000101 |
4 | 30330302303100001 |
5 | 211434120230334 |
6 | 10215433122401 |
7 | 1001401202011 |
oct | 147462632001 |
9 | 38801380011 |
10 | 13904851969 |
11 | 5995a210a8 |
12 | 2840859401 |
13 | 14079a6978 |
14 | 95c9c9c41 |
15 | 565adb214 |
hex | 33ccb3401 |
13904851969 has 2 divisors, whose sum is σ = 13904851970. Its totient is φ = 13904851968.
The previous prime is 13904851913. The next prime is 13904851997. The reversal of 13904851969 is 96915840931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13776890625 + 127961344 = 117375^2 + 11312^2 .
It is a cyclic number.
It is not a de Polignac number, because 13904851969 - 217 = 13904720897 is a prime.
It is a super-2 number, since 2×139048519692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13904851999) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6952425984 + 6952425985.
It is an arithmetic number, because the mean of its divisors is an integer number (6952425985).
Almost surely, 213904851969 is an apocalyptic number.
It is an amenable number.
13904851969 is a deficient number, since it is larger than the sum of its proper divisors (1).
13904851969 is an equidigital number, since it uses as much as digits as its factorization.
13904851969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2099520, while the sum is 55.
The spelling of 13904851969 in words is "thirteen billion, nine hundred four million, eight hundred fifty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •