Base | Representation |
---|---|
bin | 11110011100000101100… |
… | …00000110111000010100 |
3 | 10200222120112020112021122 |
4 | 33032002300012320110 |
5 | 114113420344431400 |
6 | 2120244422503112 |
7 | 135363436200260 |
oct | 17160260067024 |
9 | 3628515215248 |
10 | 1045870702100 |
11 | 373607822354 |
12 | 14a843b94a98 |
13 | 778186b5b13 |
14 | 388985a70a0 |
15 | 1c313845685 |
hex | f382c06e14 |
1045870702100 has 36 divisors (see below), whose sum is σ = 2593759342944. Its totient is φ = 358584240480.
The previous prime is 1045870702057. The next prime is 1045870702109. The reversal of 1045870702100 is 12070785401.
It is a super-2 number, since 2×10458707021002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1045870702109) 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 11 ways as a sum of consecutive naturals, for example, 747049802 + ... + 747051201.
Almost surely, 21045870702100 is an apocalyptic number.
1045870702100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1045870702100 is an abundant number, since it is smaller than the sum of its proper divisors (1547888640844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1045870702100 is a wasteful number, since it uses less digits than its factorization.
1045870702100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1494101024 (or 1494101017 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 35.
The spelling of 1045870702100 in words is "one trillion, forty-five billion, eight hundred seventy million, seven hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •