Base | Representation |
---|---|
bin | 1001011010011001100… |
… | …11110100110001001111 |
3 | 1010220210002020021012110 |
4 | 10231030303310301033 |
5 | 20244321231413403 |
6 | 404323440235103 |
7 | 32236300565064 |
oct | 4551463646117 |
9 | 1126702207173 |
10 | 323411201103 |
11 | 115181212191 |
12 | 5281990ba93 |
13 | 24661151823 |
14 | 119204acc6b |
15 | 862cb46103 |
hex | 4b4ccf4c4f |
323411201103 has 4 divisors (see below), whose sum is σ = 431214934808. Its totient is φ = 215607467400.
The previous prime is 323411201081. The next prime is 323411201123. The reversal of 323411201103 is 301102114323.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301102114323 = 3 ⋅100367371441.
It is not a de Polignac number, because 323411201103 - 29 = 323411200591 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 323411201103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323411201123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53901866848 + ... + 53901866853.
It is an arithmetic number, because the mean of its divisors is an integer number (107803733702).
Almost surely, 2323411201103 is an apocalyptic number.
323411201103 is a deficient number, since it is larger than the sum of its proper divisors (107803733705).
323411201103 is a wasteful number, since it uses less digits than its factorization.
323411201103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107803733704.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 323411201103 its reverse (301102114323), we get a palindrome (624513315426).
The spelling of 323411201103 in words is "three hundred twenty-three billion, four hundred eleven million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •