Base | Representation |
---|---|
bin | 10100011001000000000… |
… | …010011101010001000001 |
3 | 11221221211101110111022011 |
4 | 110121000002131101001 |
5 | 140424211313140411 |
6 | 2551415021412521 |
7 | 203143610065303 |
oct | 24310002352101 |
9 | 4857741414264 |
10 | 1401233724481 |
11 | 4a02949a87a8 |
12 | 1a769a40a141 |
13 | a219c3a8666 |
14 | 4bb6a3d7973 |
15 | 266b160cc21 |
hex | 1464009d441 |
1401233724481 has 2 divisors, whose sum is σ = 1401233724482. Its totient is φ = 1401233724480.
The previous prime is 1401233724463. The next prime is 1401233724551. The reversal of 1401233724481 is 1844273321041.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 815618509456 + 585615215025 = 903116^2 + 765255^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1401233724481 is a prime.
It is a super-2 number, since 2×14012337244812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1401233724421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 700616862240 + 700616862241.
It is an arithmetic number, because the mean of its divisors is an integer number (700616862241).
Almost surely, 21401233724481 is an apocalyptic number.
It is an amenable number.
1401233724481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1401233724481 is an equidigital number, since it uses as much as digits as its factorization.
1401233724481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129024, while the sum is 40.
The spelling of 1401233724481 in words is "one trillion, four hundred one billion, two hundred thirty-three million, seven hundred twenty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •