Base | Representation |
---|---|
bin | 1011010000000100… |
… | …1001110000111111 |
3 | 21210111001002221011 |
4 | 2310001021300333 |
5 | 22141132413043 |
6 | 1215405220051 |
7 | 134562166540 |
oct | 26401116077 |
9 | 7714032834 |
10 | 3020201023 |
11 | 130a908804 |
12 | 703561627 |
13 | 3919382c8 |
14 | 2091844c7 |
15 | 12a23459d |
hex | b4049c3f |
3020201023 has 8 divisors (see below), whose sum is σ = 3459899520. Its totient is φ = 2582562840.
The previous prime is 3020200991. The next prime is 3020201029. The reversal of 3020201023 is 3201020203.
It is a happy number.
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 3020201023 - 25 = 3020200991 is a prime.
It is a super-2 number, since 2×30202010232 = 18243228438660493058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020200994 and 3020201012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3020201029) 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, 511933 + ... + 517798.
It is an arithmetic number, because the mean of its divisors is an integer number (432487440).
Almost surely, 23020201023 is an apocalyptic number.
3020201023 is a deficient number, since it is larger than the sum of its proper divisors (439698497).
3020201023 is a wasteful number, since it uses less digits than its factorization.
3020201023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030157.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 3020201023 is about 54956.3556197097. The cubic root of 3020201023 is about 1445.4795442267.
Adding to 3020201023 its reverse (3201020203), we get a palindrome (6221221226).
The spelling of 3020201023 in words is "three billion, twenty million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •