Base | Representation |
---|---|
bin | 101111101000110100… |
… | …0001110010010001111 |
3 | 100210001112210221122201 |
4 | 1133101220032102033 |
5 | 3134003103331343 |
6 | 114555130222331 |
7 | 10251056052343 |
oct | 1372150162217 |
9 | 323045727581 |
10 | 102301230223 |
11 | 3a427417465 |
12 | 179b05849a7 |
13 | 98544c582a |
14 | 4d4692d623 |
15 | 29db2a094d |
hex | 17d1a0e48f |
102301230223 has 8 divisors (see below), whose sum is σ = 104394084336. Its totient is φ = 100214400000.
The previous prime is 102301230221. The next prime is 102301230277. The reversal of 102301230223 is 322032103201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102301230223 - 21 = 102301230221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102301230223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102301230221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1471653 + ... + 1539598.
It is an arithmetic number, because the mean of its divisors is an integer number (13049260542).
Almost surely, 2102301230223 is an apocalyptic number.
102301230223 is a deficient number, since it is larger than the sum of its proper divisors (2092854113).
102301230223 is an equidigital number, since it uses as much as digits as its factorization.
102301230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3011945.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 102301230223 its reverse (322032103201), we get a palindrome (424333333424).
The spelling of 102301230223 in words is "one hundred two billion, three hundred one million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •