Base | Representation |
---|---|
bin | 11110101110111110010… |
… | …00100100111010101010 |
3 | 10201221202012011102120220 |
4 | 33113133020210322222 |
5 | 114300202200230200 |
6 | 2125042523030510 |
7 | 136202632420623 |
oct | 17273710447252 |
9 | 3657665142526 |
10 | 1056010555050 |
11 | 377940478a10 |
12 | 1507b396b436 |
13 | 7877335b6c9 |
14 | 3917b132a4a |
15 | 1c708b2b4a0 |
hex | f5df224eaa |
1056010555050 has 96 divisors (see below), whose sum is σ = 2885276026944. Its totient is φ = 253467840000.
The previous prime is 1056010554899. The next prime is 1056010555057. The reversal of 1056010555050 is 505550106501.
It is a super-2 number, since 2×10560105550502 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (1056010555057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3001699 + ... + 3334998.
It is an arithmetic number, because the mean of its divisors is an integer number (30054958614).
Almost surely, 21056010555050 is an apocalyptic number.
1056010555050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1056010555050 is an abundant number, since it is smaller than the sum of its proper divisors (1829265471894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056010555050 is a wasteful number, since it uses less digits than its factorization.
1056010555050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6336824 (or 6336819 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 33.
The spelling of 1056010555050 in words is "one trillion, fifty-six billion, ten million, five hundred fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •