Base | Representation |
---|---|
bin | 1001011001101010001… |
… | …01001110100101010101 |
3 | 1010212202100011011000021 |
4 | 10230311011032211111 |
5 | 20243012324010401 |
6 | 404220135545141 |
7 | 32223365063653 |
oct | 4546505164525 |
9 | 1125670134007 |
10 | 323013110101 |
11 | 114a97530560 |
12 | 5272852b1b1 |
13 | 245c982b116 |
14 | 118c3683dd3 |
15 | 8607c0d2a1 |
hex | 4b3514e955 |
323013110101 has 4 divisors (see below), whose sum is σ = 352377938304. Its totient is φ = 293648281900.
The previous prime is 323013110059. The next prime is 323013110149. The reversal of 323013110101 is 101011310323.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 323013110101 - 211 = 323013108053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323013110201) 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, 14682414085 + ... + 14682414106.
It is an arithmetic number, because the mean of its divisors is an integer number (88094484576).
Almost surely, 2323013110101 is an apocalyptic number.
It is an amenable number.
323013110101 is a deficient number, since it is larger than the sum of its proper divisors (29364828203).
323013110101 is a wasteful number, since it uses less digits than its factorization.
323013110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29364828202.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 323013110101 its reverse (101011310323), we get a palindrome (424024420424).
The spelling of 323013110101 in words is "three hundred twenty-three billion, thirteen million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •