Base | Representation |
---|---|
bin | 1101100101001111101001… |
… | …0000010111101000000001 |
3 | 1221212121222122010010012112 |
4 | 3121103322100113220001 |
5 | 3424132304224302334 |
6 | 51432205113105105 |
7 | 3100624113252623 |
oct | 331237220275001 |
9 | 57777878103175 |
10 | 14933504915969 |
11 | 483829a233782 |
12 | 18122686b8195 |
13 | 8442b9c73203 |
14 | 398add57ac13 |
15 | 1ad6c4ad24ce |
hex | d94fa417a01 |
14933504915969 has 2 divisors, whose sum is σ = 14933504915970. Its totient is φ = 14933504915968.
The previous prime is 14933504915809. The next prime is 14933504916053. The reversal of 14933504915969 is 96951940533941.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14185859353744 + 747645562225 = 3766412^2 + 864665^2 .
It is a cyclic number.
It is not a de Polignac number, because 14933504915969 - 220 = 14933503867393 is a prime.
It is a super-2 number, since 2×149335049159692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14933504915899 and 14933504915908.
It is not a weakly prime, because it can be changed into another prime (14933504915669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7466752457984 + 7466752457985.
It is an arithmetic number, because the mean of its divisors is an integer number (7466752457985).
Almost surely, 214933504915969 is an apocalyptic number.
It is an amenable number.
14933504915969 is a deficient number, since it is larger than the sum of its proper divisors (1).
14933504915969 is an equidigital number, since it uses as much as digits as its factorization.
14933504915969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 141717600, while the sum is 68.
The spelling of 14933504915969 in words is "fourteen trillion, nine hundred thirty-three billion, five hundred four million, nine hundred fifteen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •