Base | Representation |
---|---|
bin | 1001010010000110011010… |
… | …0111110010100110110111 |
3 | 1100010201220222211210121112 |
4 | 2110201212213302212313 |
5 | 2314211020341032411 |
6 | 33412455240305235 |
7 | 2102254112400122 |
oct | 224414647624667 |
9 | 40121828753545 |
10 | 10206564002231 |
11 | 3285641327253 |
12 | 118a12577221b |
13 | 59062334708c |
14 | 274000cb53b9 |
15 | 12a7697abb8b |
hex | 948669f29b7 |
10206564002231 has 4 divisors (see below), whose sum is σ = 10307619091464. Its totient is φ = 10105508913000.
The previous prime is 10206564002189. The next prime is 10206564002237. The reversal of 10206564002231 is 13220046560201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10206564002231 is a prime.
It is a super-2 number, since 2×102065640022312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206564002237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50527544465 + ... + 50527544666.
It is an arithmetic number, because the mean of its divisors is an integer number (2576904772866).
Almost surely, 210206564002231 is an apocalyptic number.
10206564002231 is a deficient number, since it is larger than the sum of its proper divisors (101055089233).
10206564002231 is a wasteful number, since it uses less digits than its factorization.
10206564002231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101055089232.
The product of its (nonzero) digits is 17280, while the sum is 32.
The spelling of 10206564002231 in words is "ten trillion, two hundred six billion, five hundred sixty-four million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •