Base | Representation |
---|---|
bin | 10111010000111110000100… |
… | …101100010110001010010110 |
3 | 111102021210222121001100201212 |
4 | 113100332010230112022112 |
5 | 101402412340410011410 |
6 | 1001341420342421422 |
7 | 30360315342422660 |
oct | 2720760454261226 |
9 | 442253877040655 |
10 | 102321232110230 |
11 | 2a66a2110209a1 |
12 | b586659731872 |
13 | 4512b0a23b643 |
14 | 1b3a5345b7530 |
15 | bc6923e56b05 |
hex | 5d0f84b16296 |
102321232110230 has 32 divisors (see below), whose sum is σ = 210552926624064. Its totient is φ = 35070976152576.
The previous prime is 102321232110199. The next prime is 102321232110239. The reversal of 102321232110230 is 32011232123201.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102321232110196 and 102321232110205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102321232110239) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 220373567 + ... + 220837386.
It is an arithmetic number, because the mean of its divisors is an integer number (6579778957002).
Almost surely, 2102321232110230 is an apocalyptic number.
102321232110230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102321232110230 is an abundant number, since it is smaller than the sum of its proper divisors (108231694513834).
102321232110230 is a wasteful number, since it uses less digits than its factorization.
102321232110230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 441214280.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 102321232110230 its reverse (32011232123201), we get a palindrome (134332464233431).
The spelling of 102321232110230 in words is "one hundred two trillion, three hundred twenty-one billion, two hundred thirty-two million, one hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •