Base | Representation |
---|---|
bin | 10010110111101101… |
… | …10010000101111010 |
3 | 222011001022020210112 |
4 | 21123312302011322 |
5 | 131222020202302 |
6 | 4353142544322 |
7 | 506025160610 |
oct | 113366620572 |
9 | 28131266715 |
10 | 10131022202 |
11 | 4329774a24 |
12 | 1b68a380a2 |
13 | c55ba32c2 |
14 | 6c170b6b0 |
15 | 3e463e552 |
hex | 25bdb217a |
10131022202 has 8 divisors (see below), whose sum is σ = 17367466656. Its totient is φ = 4341866652.
The previous prime is 10131022201. The next prime is 10131022241. The reversal of 10131022202 is 20222013101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101310222022 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 723644443 = 10131022202 / (1 + 0 + 1 + 3 + 1 + 0 + 2 + 2 + 2 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (10131022201) 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, 361822208 + ... + 361822235.
It is an arithmetic number, because the mean of its divisors is an integer number (2170933332).
Almost surely, 210131022202 is an apocalyptic number.
10131022202 is a deficient number, since it is larger than the sum of its proper divisors (7236444454).
10131022202 is an equidigital number, since it uses as much as digits as its factorization.
10131022202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723644452.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 10131022202 its reverse (20222013101), we get a palindrome (30353035303).
The spelling of 10131022202 in words is "ten billion, one hundred thirty-one million, twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •