Base | Representation |
---|---|
bin | 101111101000110011… |
… | …1110100001011111011 |
3 | 100210001112121112000110 |
4 | 1133101213310023323 |
5 | 3134003041421243 |
6 | 114555124035403 |
7 | 10251055125600 |
oct | 1372147641373 |
9 | 323045545013 |
10 | 102301123323 |
11 | 3a427354113 |
12 | 179b0532b63 |
13 | 9854488c89 |
14 | 4d469026a7 |
15 | 29db27de33 |
hex | 17d19f42fb |
102301123323 has 48 divisors (see below), whose sum is σ = 160966776096. Its totient is φ = 57613248000.
The previous prime is 102301123273. The next prime is 102301123339. The reversal of 102301123323 is 323321103201.
It is not a de Polignac number, because 102301123323 - 233 = 93711188731 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 102301123323.
It is not an unprimeable number, because it can be changed into a prime (102301123423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18594073 + ... + 18599573.
It is an arithmetic number, because the mean of its divisors is an integer number (3353474502).
Almost surely, 2102301123323 is an apocalyptic number.
102301123323 is a deficient number, since it is larger than the sum of its proper divisors (58665652773).
102301123323 is a wasteful number, since it uses less digits than its factorization.
102301123323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7324 (or 7317 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102301123323 its reverse (323321103201), we get a palindrome (425622226524).
The spelling of 102301123323 in words is "one hundred two billion, three hundred one million, one hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •