Base | Representation |
---|---|
bin | 10011000010111110… |
… | …11001101110110001 |
3 | 222101122012002100011 |
4 | 21201133121232301 |
5 | 131420220301101 |
6 | 4410401054521 |
7 | 511253536534 |
oct | 114137315661 |
9 | 28348162304 |
10 | 10225556401 |
11 | 4378072965 |
12 | 1b94627441 |
13 | c6c651cb8 |
14 | 6d00b8a1b |
15 | 3ecab4751 |
hex | 2617d9bb1 |
10225556401 has 6 divisors (see below), whose sum is σ = 10792069602. Its totient is φ = 9687368880.
The previous prime is 10225556377. The next prime is 10225556461. The reversal of 10225556401 is 10465552201.
10225556401 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 7839331600 + 2386224801 = 88540^2 + 48849^2 .
It is not a de Polignac number, because 10225556401 - 221 = 10223459249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10225556461) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 14162460 + ... + 14163181.
It is an arithmetic number, because the mean of its divisors is an integer number (1798678267).
Almost surely, 210225556401 is an apocalyptic number.
It is an amenable number.
10225556401 is a deficient number, since it is larger than the sum of its proper divisors (566513201).
10225556401 is an equidigital number, since it uses as much as digits as its factorization.
10225556401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28325679 (or 28325660 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
The spelling of 10225556401 in words is "ten billion, two hundred twenty-five million, five hundred fifty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •