Base | Representation |
---|---|
bin | 10011000101111100… |
… | …10101010100101111 |
3 | 222110101000102000011 |
4 | 21202332111110233 |
5 | 131443103121111 |
6 | 4413050314051 |
7 | 512005214434 |
oct | 114276252457 |
9 | 28411012004 |
10 | 10250442031 |
11 | 439011a8a5 |
12 | 1ba0a28927 |
13 | c7485611b |
14 | 6d3515b8b |
15 | 3eed7d021 |
hex | 262f9552f |
10250442031 has 8 divisors (see below), whose sum is σ = 10800110720. Its totient is φ = 9701790552.
The previous prime is 10250442029. The next prime is 10250442053. The reversal of 10250442031 is 13024405201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10250442031 - 21 = 10250442029 is a prime.
It is a super-2 number, since 2×102504420312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10250441993 and 10250442011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10250442061) 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 7 ways as a sum of consecutive naturals, for example, 233565 + ... + 273958.
It is an arithmetic number, because the mean of its divisors is an integer number (1350013840).
Almost surely, 210250442031 is an apocalyptic number.
10250442031 is a deficient number, since it is larger than the sum of its proper divisors (549668689).
10250442031 is a wasteful number, since it uses less digits than its factorization.
10250442031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508605.
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 10250442031 its reverse (13024405201), we get a palindrome (23274847232).
The spelling of 10250442031 in words is "ten billion, two hundred fifty million, four hundred forty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •