Base | Representation |
---|---|
bin | 101111100110101110… |
… | …1000101100011101110 |
3 | 100202212200001011000221 |
4 | 1133031131011203232 |
5 | 3133332141431110 |
6 | 114544145241554 |
7 | 10246245610456 |
oct | 1371535054356 |
9 | 322780034027 |
10 | 102231202030 |
11 | 3a3a0937221 |
12 | 179910332ba |
13 | 9842b47229 |
14 | 4d3b500d66 |
15 | 29d506b7da |
hex | 17cd7458ee |
102231202030 has 8 divisors (see below), whose sum is σ = 184016163672. Its totient is φ = 40892480808.
The previous prime is 102231202013. The next prime is 102231202061. The reversal of 102231202030 is 30202132201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1022312020302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102231201995 and 102231202013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5111560092 + ... + 5111560111.
It is an arithmetic number, because the mean of its divisors is an integer number (23002020459).
Almost surely, 2102231202030 is an apocalyptic number.
102231202030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102231202030 is a deficient number, since it is larger than the sum of its proper divisors (81784961642).
102231202030 is a wasteful number, since it uses less digits than its factorization.
102231202030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10223120210.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 102231202030 its reverse (30202132201), we get a palindrome (132433334231).
It can be divided in two parts, 102 and 231202030, that added together give a palindrome (231202132).
The spelling of 102231202030 in words is "one hundred two billion, two hundred thirty-one million, two hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •