Base | Representation |
---|---|
bin | 11110101101000111100… |
… | …00100100010010000010 |
3 | 10201212011202201202221212 |
4 | 33112203300210102002 |
5 | 114241132141432000 |
6 | 2124400020050122 |
7 | 136136145324041 |
oct | 17264360442202 |
9 | 3655152652855 |
10 | 1055014405250 |
11 | 37747a144913 |
12 | 150576233942 |
13 | 78644b6bb60 |
14 | 390c4b08558 |
15 | 1c69b45ac35 |
hex | f5a3c24482 |
1055014405250 has 64 divisors (see below), whose sum is σ = 2195519219712. Its totient is φ = 376977816000.
The previous prime is 1055014405223. The next prime is 1055014405253. The reversal of 1055014405250 is 525044105501.
It is a super-2 number, since 2×10550144052502 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1055014405253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5135054 + ... + 5336553.
It is an arithmetic number, because the mean of its divisors is an integer number (34304987808).
Almost surely, 21055014405250 is an apocalyptic number.
1055014405250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1055014405250 is an abundant number, since it is smaller than the sum of its proper divisors (1140504814462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055014405250 is a wasteful number, since it uses less digits than its factorization.
1055014405250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10471668 (or 10471658 counting only the distinct ones).
The product of its (nonzero) digits is 20000, while the sum is 32.
The spelling of 1055014405250 in words is "one trillion, fifty-five billion, fourteen million, four hundred five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •