Base | Representation |
---|---|
bin | 111111000001111100001… |
… | …010011001010010011001 |
3 | 120100002010102022212110211 |
4 | 333001330022121102121 |
5 | 1031431211443243134 |
6 | 13113453343211121 |
7 | 624635244445606 |
oct | 77017412312231 |
9 | 16302112285424 |
10 | 4331410134169 |
11 | 141aa39112638 |
12 | 59b5585a6aa1 |
13 | 2555b11a8841 |
14 | 10d8d9cb96ad |
15 | 77a0ae8a764 |
hex | 3f07c299499 |
4331410134169 has 2 divisors, whose sum is σ = 4331410134170. Its totient is φ = 4331410134168.
The previous prime is 4331410134119. The next prime is 4331410134173. The reversal of 4331410134169 is 9614310141334.
4331410134169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3986459478544 + 344950655625 = 1996612^2 + 587325^2 .
It is a cyclic number.
It is not a de Polignac number, because 4331410134169 - 215 = 4331410101401 is a prime.
It is a super-2 number, since 2×43314101341692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4331410134119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2165705067084 + 2165705067085.
It is an arithmetic number, because the mean of its divisors is an integer number (2165705067085).
Almost surely, 24331410134169 is an apocalyptic number.
It is an amenable number.
4331410134169 is a deficient number, since it is larger than the sum of its proper divisors (1).
4331410134169 is an equidigital number, since it uses as much as digits as its factorization.
4331410134169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 40.
The spelling of 4331410134169 in words is "four trillion, three hundred thirty-one billion, four hundred ten million, one hundred thirty-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •