Base | Representation |
---|---|
bin | 100111110000011… |
… | …1101011000111001 |
3 | 10102222020021000101 |
4 | 1033200331120321 |
5 | 10213003240441 |
6 | 340213035401 |
7 | 45026103541 |
oct | 11740753071 |
9 | 3388207011 |
10 | 1334040121 |
11 | 6250380a7 |
12 | 312925b61 |
13 | 1834c5b6b |
14 | c9262321 |
15 | 7c1b6231 |
hex | 4f83d639 |
1334040121 has 2 divisors, whose sum is σ = 1334040122. Its totient is φ = 1334040120.
The previous prime is 1334040079. The next prime is 1334040137. The reversal of 1334040121 is 1210404331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 684554896 + 649485225 = 26164^2 + 25485^2 .
It is a cyclic number.
It is not a de Polignac number, because 1334040121 - 211 = 1334038073 is a prime.
It is not a weakly prime, because it can be changed into another prime (1334040161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 667020060 + 667020061.
It is an arithmetic number, because the mean of its divisors is an integer number (667020061).
Almost surely, 21334040121 is an apocalyptic number.
It is an amenable number.
1334040121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1334040121 is an equidigital number, since it uses as much as digits as its factorization.
1334040121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1334040121 is about 36524.5139734946. The cubic root of 1334040121 is about 1100.8368620656.
Adding to 1334040121 its reverse (1210404331), we get a palindrome (2544444452).
It can be divided in two parts, 1334040 and 121, that added together give a triangular number (1334161 = T1633).
The spelling of 1334040121 in words is "one billion, three hundred thirty-four million, forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •