Base | Representation |
---|---|
bin | 101111100001010111… |
… | …1010011111010000101 |
3 | 100202102010202210012101 |
4 | 1133002233103322011 |
5 | 3133000131230041 |
6 | 114514244152101 |
7 | 10241633562022 |
oct | 1370257237205 |
9 | 322363683171 |
10 | 102051430021 |
11 | 3a30940a912 |
12 | 17940998631 |
13 | 9814823068 |
14 | 4d216a6549 |
15 | 29c43aab31 |
hex | 17c2bd3e85 |
102051430021 has 4 divisors (see below), whose sum is σ = 102052069132. Its totient is φ = 102050790912.
The previous prime is 102051429979. The next prime is 102051430027. The reversal of 102051430021 is 120034150201.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 1882344996 + 100169085025 = 43386^2 + 316495^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102051430021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102051430027) 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, 147781 + ... + 475333.
It is an arithmetic number, because the mean of its divisors is an integer number (25513017283).
Almost surely, 2102051430021 is an apocalyptic number.
It is an amenable number.
102051430021 is a deficient number, since it is larger than the sum of its proper divisors (639111).
102051430021 is an equidigital number, since it uses as much as digits as its factorization.
102051430021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639110.
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 102051430021 its reverse (120034150201), we get a palindrome (222085580222).
The spelling of 102051430021 in words is "one hundred two billion, fifty-one million, four hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •