Base | Representation |
---|---|
bin | 11000010101101111111… |
… | …100111100100111100010 |
3 | 12220220022210121102210020 |
4 | 120111233330330213202 |
5 | 204401011323313200 |
6 | 3320220302414310 |
7 | 231562044614235 |
oct | 30255774744742 |
9 | 5826283542706 |
10 | 1672620526050 |
11 | 595399755571 |
12 | 2301b9291396 |
13 | c195c24c306 |
14 | 5ad5336941c |
15 | 2d796ccbea0 |
hex | 1856ff3c9e2 |
1672620526050 has 96 divisors (see below), whose sum is σ = 4227955429248. Its totient is φ = 437451755520.
The previous prime is 1672620526043. The next prime is 1672620526061. The reversal of 1672620526050 is 506250262761.
It is a junction number, because it is equal to n+sod(n) for n = 1672620525993 and 1672620526011.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21848139 + ... + 21924561.
It is an arithmetic number, because the mean of its divisors is an integer number (44041202388).
Almost surely, 21672620526050 is an apocalyptic number.
1672620526050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1672620526050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2113977714624).
1672620526050 is an abundant number, since it is smaller than the sum of its proper divisors (2555334903198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1672620526050 is a wasteful number, since it uses less digits than its factorization.
1672620526050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79244 (or 79239 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 1672620526050 in words is "one trillion, six hundred seventy-two billion, six hundred twenty million, five hundred twenty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •