Base | Representation |
---|---|
bin | 1001001011111110110100… |
… | …0000011000001101000001 |
3 | 1022202200121000210100011011 |
4 | 2102333231000120031001 |
5 | 2311000224232142400 |
6 | 33252312310520521 |
7 | 2061543131541205 |
oct | 222775500301501 |
9 | 38680530710134 |
10 | 10101444412225 |
11 | 3244aa9032431 |
12 | 1171889366141 |
13 | 58373cc9664a |
14 | 26ccabd42b05 |
15 | 127b65d968ba |
hex | 92fed018341 |
10101444412225 has 12 divisors (see below), whose sum is σ = 12553688169900. Its totient is φ = 8063157401600.
The previous prime is 10101444412193. The next prime is 10101444412237. The reversal of 10101444412225 is 52221444410101.
It can be written as a sum of positive squares in 6 ways, for example, as 636001465009 + 9465442947216 = 797497^2 + 3076596^2 .
It is not a de Polignac number, because 10101444412225 - 25 = 10101444412193 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 449941756 + ... + 449964205.
It is an arithmetic number, because the mean of its divisors is an integer number (1046140680825).
Almost surely, 210101444412225 is an apocalyptic number.
It is an amenable number.
10101444412225 is a deficient number, since it is larger than the sum of its proper divisors (2452243757675).
10101444412225 is an equidigital number, since it uses as much as digits as its factorization.
10101444412225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 899906420 (or 899906415 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 31.
Adding to 10101444412225 its reverse (52221444410101), we get a palindrome (62322888822326).
The spelling of 10101444412225 in words is "ten trillion, one hundred one billion, four hundred forty-four million, four hundred twelve thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •