Base | Representation |
---|---|
bin | 101101011100110011001… |
… | …111111001100001111101 |
3 | 102001120210012220120211102 |
4 | 231130303033321201331 |
5 | 402133010030430023 |
6 | 10350454044302445 |
7 | 441436211501513 |
oct | 55346317714175 |
9 | 12046705816742 |
10 | 3123301030013 |
11 | aa464800957a |
12 | 425397241a25 |
13 | 1986ab89a368 |
14 | ab2508064b3 |
15 | 5639e402628 |
hex | 2d7333f987d |
3123301030013 has 8 divisors (see below), whose sum is σ = 3153709104000. Its totient is φ = 3092894586288.
The previous prime is 3123301030001. The next prime is 3123301030019. The reversal of 3123301030013 is 3100301033213.
3123301030013 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3123301030013 - 210 = 3123301028989 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 (3123301030019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3637163 + ... + 4413111.
It is an arithmetic number, because the mean of its divisors is an integer number (394213638000).
Almost surely, 23123301030013 is an apocalyptic number.
It is an amenable number.
3123301030013 is a deficient number, since it is larger than the sum of its proper divisors (30408073987).
3123301030013 is a wasteful number, since it uses less digits than its factorization.
3123301030013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 815131.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 3123301030013 its reverse (3100301033213), we get a palindrome (6223602063226).
The spelling of 3123301030013 in words is "three trillion, one hundred twenty-three billion, three hundred one million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •