Base | Representation |
---|---|
bin | 1001100000011010011001… |
… | …0111011110011100101010 |
3 | 1101000020120222100002212211 |
4 | 2120012212113132130222 |
5 | 2332223102312244200 |
6 | 34121442045555334 |
7 | 2126110241123464 |
oct | 230064627363452 |
9 | 41006528302784 |
10 | 10452446603050 |
11 | 336a948681561 |
12 | 1209907275b4a |
13 | 5aa87a38b39a |
14 | 281c88933134 |
15 | 131d5adb0aba |
hex | 981a65de72a |
10452446603050 has 24 divisors (see below), whose sum is σ = 19524990835116. Its totient is φ = 4163034522240.
The previous prime is 10452446602991. The next prime is 10452446603069. The reversal of 10452446603050 is 5030664425401.
10452446603050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 3428870661841 + 7023575941209 = 1851721^2 + 2650203^2 .
It is a super-2 number, since 2×104524466030502 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10452446602994 and 10452446603012.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 448591209 + ... + 448614508.
Almost surely, 210452446603050 is an apocalyptic number.
10452446603050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10452446603050 is a deficient number, since it is larger than the sum of its proper divisors (9072544232066).
10452446603050 is a wasteful number, since it uses less digits than its factorization.
10452446603050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 897205962 (or 897205957 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 10452446603050 in words is "ten trillion, four hundred fifty-two billion, four hundred forty-six million, six hundred three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •