Base | Representation |
---|---|
bin | 110000001000000001000010… |
… | …0101010000001011010010101 |
3 | 2001111211102221121001121212201 |
4 | 1200100002010222001122111 |
5 | 420441034441242131401 |
6 | 4100151505422244501 |
7 | 155110304361505405 |
oct | 14020020452013225 |
9 | 2044742847047781 |
10 | 423314202302101 |
11 | 1129765aa46a460 |
12 | 3b589165a26731 |
13 | 15228486681226 |
14 | 7676733bd8805 |
15 | 33e1591b5bb01 |
hex | 1810084a81695 |
423314202302101 has 16 divisors (see below), whose sum is σ = 477846186079680. Its totient is φ = 371658144654720.
The previous prime is 423314202302093. The next prime is 423314202302113. The reversal of 423314202302101 is 101203202413324.
It is not a de Polignac number, because 423314202302101 - 23 = 423314202302093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 423314202302101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (423314202302501) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5027800770 + ... + 5027884963.
It is an arithmetic number, because the mean of its divisors is an integer number (29865386629980).
Almost surely, 2423314202302101 is an apocalyptic number.
It is an amenable number.
423314202302101 is a deficient number, since it is larger than the sum of its proper divisors (54531983777579).
423314202302101 is a wasteful number, since it uses less digits than its factorization.
423314202302101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10055685876.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 423314202302101 its reverse (101203202413324), we get a palindrome (524517404715425).
The spelling of 423314202302101 in words is "four hundred twenty-three trillion, three hundred fourteen billion, two hundred two million, three hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •