Base | Representation |
---|---|
bin | 11110101111111000100… |
… | …11101010101011011100 |
3 | 10202000000022010212220012 |
4 | 33113330103222223130 |
5 | 114302203000022000 |
6 | 2125203245342352 |
7 | 136221024561326 |
oct | 17277423525334 |
9 | 3660008125805 |
10 | 1056500001500 |
11 | 378071787309 |
12 | 15090b8679b8 |
13 | 78820889ca8 |
14 | 391c613c616 |
15 | 1c736aac735 |
hex | f5fc4eaadc |
1056500001500 has 24 divisors (see below), whose sum is σ = 2307396004368. Its totient is φ = 422600000400.
The previous prime is 1056500001497. The next prime is 1056500001509. The reversal of 1056500001500 is 51000056501.
It is a super-2 number, since 2×10565000015002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056500001509) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1056499502 + ... + 1056500501.
It is an arithmetic number, because the mean of its divisors is an integer number (96141500182).
Almost surely, 21056500001500 is an apocalyptic number.
1056500001500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1056500001500 is an abundant number, since it is smaller than the sum of its proper divisors (1250896002868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056500001500 is a wasteful number, since it uses less digits than its factorization.
1056500001500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2113000022 (or 2113000010 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
The spelling of 1056500001500 in words is "one trillion, fifty-six billion, five hundred million, one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •