Base | Representation |
---|---|
bin | 11101001110000111010… |
… | …10010100010000011110 |
3 | 10112222112012000001122202 |
4 | 32213003222110100132 |
5 | 112422203031430420 |
6 | 2045122535211502 |
7 | 132352206305633 |
oct | 16470352242036 |
9 | 3488465001582 |
10 | 1004010030110 |
11 | 35788653a96a |
12 | 142700b16b92 |
13 | 738a6cbc719 |
14 | 36846c4c18a |
15 | 1b1b381d575 |
hex | e9c3a9441e |
1004010030110 has 32 divisors (see below), whose sum is σ = 1834469862912. Its totient is φ = 395549874720.
The previous prime is 1004010030077. The next prime is 1004010030119. The reversal of 1004010030110 is 110300104001.
It is a super-2 number, since 2×10040100301102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1004010030091 and 1004010030100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004010030119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4439639 + ... + 4660301.
It is an arithmetic number, because the mean of its divisors is an integer number (57327183216).
Almost surely, 21004010030110 is an apocalyptic number.
1004010030110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1004010030110 is a deficient number, since it is larger than the sum of its proper divisors (830459832802).
1004010030110 is a wasteful number, since it uses less digits than its factorization.
1004010030110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227528.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1004010030110 its reverse (110300104001), we get a palindrome (1114310134111).
The spelling of 1004010030110 in words is "one trillion, four billion, ten million, thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •