Base | Representation |
---|---|
bin | 11101010000011100101… |
… | …000100110100110100011 |
3 | 21010012111221200100111022 |
4 | 131100130220212212203 |
5 | 230420023411203301 |
6 | 4135342242240055 |
7 | 265153454245100 |
oct | 35203450464643 |
9 | 7105457610438 |
10 | 2010525100451 |
11 | 70572800660a |
12 | 2857a095602b |
13 | 11778cc8476a |
14 | 6d44a65daa7 |
15 | 37472010d1b |
hex | 1d41ca269a3 |
2010525100451 has 12 divisors (see below), whose sum is σ = 2339119485720. Its totient is φ = 1723052731680.
The previous prime is 2010525100391. The next prime is 2010525100483. The reversal of 2010525100451 is 1540015250102.
It is not a de Polignac number, because 2010525100451 - 238 = 1735647193507 is a prime.
It is a super-2 number, since 2×20105251004512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2010525100451.
It is not an unprimeable number, because it can be changed into a prime (2010525100151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2694170 + ... + 3358511.
It is an arithmetic number, because the mean of its divisors is an integer number (194926623810).
Almost surely, 22010525100451 is an apocalyptic number.
2010525100451 is a deficient number, since it is larger than the sum of its proper divisors (328594385269).
2010525100451 is an equidigital number, since it uses as much as digits as its factorization.
2010525100451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6059474 (or 6059467 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 26.
The spelling of 2010525100451 in words is "two trillion, ten billion, five hundred twenty-five million, one hundred thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •