Base | Representation |
---|---|
bin | 11101111111110000011… |
… | …01101001011111000110 |
3 | 10122112022120110120111122 |
4 | 32333320031221133012 |
5 | 113341243321323420 |
6 | 2105251313033542 |
7 | 134314516203500 |
oct | 16777015513706 |
9 | 3575276416448 |
10 | 1030661511110 |
11 | 368112610020 |
12 | 1478ba5558b2 |
13 | 7626371521a |
14 | 37c5468ad70 |
15 | 1bc234ad725 |
hex | eff83697c6 |
1030661511110 has 96 divisors (see below), whose sum is σ = 2478177089280. Its totient is φ = 304337476800.
The previous prime is 1030661511107. The next prime is 1030661511149. The reversal of 1030661511110 is 111151660301.
It is a self number, because there is not a number n which added to its sum of digits gives 1030661511110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4929626 + ... + 5134445.
It is an arithmetic number, because the mean of its divisors is an integer number (25814344680).
Almost surely, 21030661511110 is an apocalyptic number.
1030661511110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030661511110 is an abundant number, since it is smaller than the sum of its proper divisors (1447515578170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030661511110 is a wasteful number, since it uses less digits than its factorization.
1030661511110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10064122 (or 10064115 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 26.
The spelling of 1030661511110 in words is "one trillion, thirty billion, six hundred sixty-one million, five hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •