Base | Representation |
---|---|
bin | 1001010100010111010010… |
… | …1001011010101001010101 |
3 | 1100021110022022021010222002 |
4 | 2111011310221122221111 |
5 | 2320330142211440221 |
6 | 33442410244245045 |
7 | 2105131621140536 |
oct | 225056451325125 |
9 | 40243268233862 |
10 | 10245454015061 |
11 | 32a0088769521 |
12 | 11957799a0785 |
13 | 5941b045cba5 |
14 | 275c4dca468d |
15 | 12b793ad880b |
hex | 95174a5aa55 |
10245454015061 has 2 divisors, whose sum is σ = 10245454015062. Its totient is φ = 10245454015060.
The previous prime is 10245454015037. The next prime is 10245454015091. The reversal of 10245454015061 is 16051045454201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9438320674225 + 807133340836 = 3072185^2 + 898406^2 .
It is a cyclic number.
It is not a de Polignac number, because 10245454015061 - 218 = 10245453752917 is a prime.
It is a super-2 number, since 2×102454540150612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10245454015021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5122727007530 + 5122727007531.
It is an arithmetic number, because the mean of its divisors is an integer number (5122727007531).
Almost surely, 210245454015061 is an apocalyptic number.
It is an amenable number.
10245454015061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10245454015061 is an equidigital number, since it uses as much as digits as its factorization.
10245454015061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96000, while the sum is 38.
Adding to 10245454015061 its reverse (16051045454201), we get a palindrome (26296499469262).
The spelling of 10245454015061 in words is "ten trillion, two hundred forty-five billion, four hundred fifty-four million, fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •