Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1001010111101100001 |
3 | 100202022022201220110111 |
4 | 1133000111022331201 |
5 | 3132404310220301 |
6 | 114510242131321 |
7 | 10240633250623 |
oct | 1370025127541 |
9 | 322268656414 |
10 | 102011023201 |
11 | 3a29862164a |
12 | 1792b350b41 |
13 | 98093462b9 |
14 | 4d1a188c13 |
15 | 29c0a78551 |
hex | 17c054af61 |
102011023201 has 4 divisors (see below), whose sum is σ = 103062683332. Its totient is φ = 100959363072.
The previous prime is 102011023159. The next prime is 102011023207. The reversal of 102011023201 is 102320110201.
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 66706492176 + 35304531025 = 258276^2 + 187895^2 .
It is not a de Polignac number, because 102011023201 - 27 = 102011023073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102011023207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 525829920 + ... + 525830113.
It is an arithmetic number, because the mean of its divisors is an integer number (25765670833).
Almost surely, 2102011023201 is an apocalyptic number.
It is an amenable number.
102011023201 is a deficient number, since it is larger than the sum of its proper divisors (1051660131).
102011023201 is an equidigital number, since it uses as much as digits as its factorization.
102011023201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1051660130.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 102011023201 its reverse (102320110201), we get a palindrome (204331133402).
It can be divided in two parts, 10201 and 1023201, that multiplied together give a palindrome (10437673401).
The spelling of 102011023201 in words is "one hundred two billion, eleven million, twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •