Base | Representation |
---|---|
bin | 10010000011101000100… |
… | …01000011111000110011 |
3 | 2012022102112211022012200 |
4 | 21001310101003320303 |
5 | 40131113013420201 |
6 | 1153004132354243 |
7 | 62552506210230 |
oct | 11016421037063 |
9 | 2168375738180 |
10 | 620425920051 |
11 | 21a137291663 |
12 | a02ab475983 |
13 | 46676650632 |
14 | 22058d5a787 |
15 | 112131bc386 |
hex | 9074443e33 |
620425920051 has 48 divisors (see below), whose sum is σ = 1028777637888. Its totient is φ = 352943827200.
The previous prime is 620425920041. The next prime is 620425920071. The reversal of 620425920051 is 150029524026.
620425920051 is a `hidden beast` number, since 6 + 20 + 42 + 592 + 0 + 0 + 5 + 1 = 666.
It is not a de Polignac number, because 620425920051 - 25 = 620425920019 is a prime.
It is a super-2 number, since 2×6204259200512 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 620425919988 and 620425920015.
It is not an unprimeable number, because it can be changed into a prime (620425920011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 74863230 + ... + 74871516.
It is an arithmetic number, because the mean of its divisors is an integer number (21432867456).
Almost surely, 2620425920051 is an apocalyptic number.
620425920051 is a deficient number, since it is larger than the sum of its proper divisors (408351717837).
620425920051 is a wasteful number, since it uses less digits than its factorization.
620425920051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13472 (or 13469 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 620425920051 in words is "six hundred twenty billion, four hundred twenty-five million, nine hundred twenty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •