Base | Representation |
---|---|
bin | 1001010010000110100111… |
… | …1111011010001110001010 |
3 | 1100010202001221012110220002 |
4 | 2110201221333122032022 |
5 | 2314211124323303300 |
6 | 33412505020003002 |
7 | 2102255400003626 |
oct | 224415177321612 |
9 | 40122057173802 |
10 | 10206620525450 |
11 | 3285670222a58 |
12 | 118a140690462 |
13 | 590631c7767b |
14 | 2740085ca186 |
15 | 12a76e7245d5 |
hex | 94869fda38a |
10206620525450 has 24 divisors (see below), whose sum is σ = 18984592274400. Its totient is φ = 4082588404400.
The previous prime is 10206620525447. The next prime is 10206620525459. The reversal of 10206620525450 is 5452502660201.
It is a happy number.
10206620525450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×102066205254503 (a number of 40 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10206620525459) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2034755 + ... + 4955145.
It is an arithmetic number, because the mean of its divisors is an integer number (791024678100).
Almost surely, 210206620525450 is an apocalyptic number.
10206620525450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10206620525450 is a deficient number, since it is larger than the sum of its proper divisors (8777971748950).
10206620525450 is a wasteful number, since it uses less digits than its factorization.
10206620525450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2990302 (or 2990297 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 38.
The spelling of 10206620525450 in words is "ten trillion, two hundred six billion, six hundred twenty million, five hundred twenty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •