Base | Representation |
---|---|
bin | 1001010001111101110000… |
… | …1000110101001011010001 |
3 | 1100010111221002000021201222 |
4 | 2110133130020311023101 |
5 | 2314141241100133411 |
6 | 33411432522334425 |
7 | 2102142411144422 |
oct | 224373410651321 |
9 | 40114832007658 |
10 | 10204240630481 |
11 | 32846598a2707 |
12 | 118979765a415 |
13 | 590342baabb1 |
14 | 273c604c1649 |
15 | 12a6808204db |
hex | 947dc2352d1 |
10204240630481 has 2 divisors, whose sum is σ = 10204240630482. Its totient is φ = 10204240630480.
The previous prime is 10204240630471. The next prime is 10204240630531. The reversal of 10204240630481 is 18403604240201.
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., 9784440304081 + 419800326400 = 3128009^2 + 647920^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10204240630481 is a prime.
It is a super-2 number, since 2×102042406304812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10204240630421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5102120315240 + 5102120315241.
It is an arithmetic number, because the mean of its divisors is an integer number (5102120315241).
Almost surely, 210204240630481 is an apocalyptic number.
It is an amenable number.
10204240630481 is a deficient number, since it is larger than the sum of its proper divisors (1).
10204240630481 is an equidigital number, since it uses as much as digits as its factorization.
10204240630481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 35.
Adding to 10204240630481 its reverse (18403604240201), we get a palindrome (28607844870682).
The spelling of 10204240630481 in words is "ten trillion, two hundred four billion, two hundred forty million, six hundred thirty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.878 sec. • engine limits •