Base | Representation |
---|---|
bin | 10010111000101101… |
… | …11110101101100001 |
3 | 222011122012001201001 |
4 | 21130112332231201 |
5 | 131231200244442 |
6 | 4354043512001 |
7 | 506160003103 |
oct | 113426765541 |
9 | 28148161631 |
10 | 10139462497 |
11 | 433350a27a |
12 | 1b6b828601 |
13 | c57869c68 |
14 | 6c28a7573 |
15 | 3e525a2b7 |
hex | 25c5beb61 |
10139462497 has 4 divisors (see below), whose sum is σ = 10139965956. Its totient is φ = 10138959040.
The previous prime is 10139462471. The next prime is 10139462503. The reversal of 10139462497 is 79426493101.
10139462497 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 322417936 + 9817044561 = 17956^2 + 99081^2 .
It is a cyclic number.
It is not a de Polignac number, because 10139462497 - 231 = 7991978849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10139462467) 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 3 ways as a sum of consecutive naturals, for example, 220204 + ... + 262237.
It is an arithmetic number, because the mean of its divisors is an integer number (2534991489).
Almost surely, 210139462497 is an apocalyptic number.
It is an amenable number.
10139462497 is a deficient number, since it is larger than the sum of its proper divisors (503459).
10139462497 is an equidigital number, since it uses as much as digits as its factorization.
10139462497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503458.
The product of its (nonzero) digits is 326592, while the sum is 46.
The spelling of 10139462497 in words is "ten billion, one hundred thirty-nine million, four hundred sixty-two thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •