Base | Representation |
---|---|
bin | 110111000010011000110000… |
… | …0001110101111000011010011 |
3 | 2100111002202122200010112020122 |
4 | 1232010301200032233003103 |
5 | 1001423202211420231121 |
6 | 4433342302100300455 |
7 | 203654010054022355 |
oct | 15604614016570323 |
9 | 2314082580115218 |
10 | 484113148211411 |
11 | 1302872623a8324 |
12 | 463684559a172b |
13 | 17a1889b9b0884 |
14 | 87792b68a90d5 |
15 | 3ae7d621d85ab |
hex | 1b84c603af0d3 |
484113148211411 has 2 divisors, whose sum is σ = 484113148211412. Its totient is φ = 484113148211410.
The previous prime is 484113148211351. The next prime is 484113148211443. The reversal of 484113148211411 is 114112841311484.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 484113148211411 - 218 = 484113147949267 is a prime.
It is a super-2 number, since 2×4841131482114112 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (484113148211611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 242056574105705 + 242056574105706.
It is an arithmetic number, because the mean of its divisors is an integer number (242056574105706).
Almost surely, 2484113148211411 is an apocalyptic number.
484113148211411 is a deficient number, since it is larger than the sum of its proper divisors (1).
484113148211411 is an equidigital number, since it uses as much as digits as its factorization.
484113148211411 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 98304, while the sum is 44.
Adding to 484113148211411 its reverse (114112841311484), we get a palindrome (598225989522895).
The spelling of 484113148211411 in words is "four hundred eighty-four trillion, one hundred thirteen billion, one hundred forty-eight million, two hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •