Base | Representation |
---|---|
bin | 10011000111101100… |
… | …11000010110011010 |
3 | 222111101122212021022 |
4 | 21203312120112122 |
5 | 132010333300430 |
6 | 4414333242442 |
7 | 512244126542 |
oct | 114366302632 |
9 | 28441585238 |
10 | 10265134490 |
11 | 4398445526 |
12 | 1ba5933422 |
13 | c778cb7a0 |
14 | 6d545c322 |
15 | 4012d14e5 |
hex | 263d9859a |
10265134490 has 16 divisors (see below), whose sum is σ = 19898568648. Its totient is φ = 3790203456.
The previous prime is 10265134487. The next prime is 10265134519. The reversal of 10265134490 is 9443156201.
10265134490 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 1013172+1.
It can be written as a sum of positive squares in 4 ways, for example, as 7619369521 + 2645764969 = 87289^2 + 51437^2 .
It is a super-4 number, since 4×102651344904 (a number of 41 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10265134490.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39481157 + ... + 39481416.
Almost surely, 210265134490 is an apocalyptic number.
10265134490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10265134490 is a deficient number, since it is larger than the sum of its proper divisors (9633434158).
10265134490 is a wasteful number, since it uses less digits than its factorization.
10265134490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78962593.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 10265134490 in words is "ten billion, two hundred sixty-five million, one hundred thirty-four thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •