Base | Representation |
---|---|
bin | 1001010101111100100… |
… | …10100000010111010110 |
3 | 1010200121102221212000012 |
4 | 10222332102200113112 |
5 | 20224422121231402 |
6 | 403250302520222 |
7 | 32123114563010 |
oct | 4527622402726 |
9 | 1120542855005 |
10 | 321020102102 |
11 | 11416452a107 |
12 | 52270b96072 |
13 | 2436c96144b |
14 | 11774ac91b0 |
15 | 853cc7c452 |
hex | 4abe4a05d6 |
321020102102 has 8 divisors (see below), whose sum is σ = 550320175056. Its totient is φ = 137580043752.
The previous prime is 321020102101. The next prime is 321020102107. The reversal of 321020102102 is 201201020123.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 22930007293 = 321020102102 / (3 + 2 + 1 + 0 + 2 + 0 + 1 + 0 + 2 + 1 + 0 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321020102101) 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 3 ways as a sum of consecutive naturals, for example, 11465003633 + ... + 11465003660.
It is an arithmetic number, because the mean of its divisors is an integer number (68790021882).
Almost surely, 2321020102102 is an apocalyptic number.
321020102102 is a deficient number, since it is larger than the sum of its proper divisors (229300072954).
321020102102 is a wasteful number, since it uses less digits than its factorization.
321020102102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22930007302.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 321020102102 its reverse (201201020123), we get a palindrome (522221122225).
The spelling of 321020102102 in words is "three hundred twenty-one billion, twenty million, one hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •