Base | Representation |
---|---|
bin | 11101011110110111000… |
… | …00010111110101100110 |
3 | 10120211201201020102012000 |
4 | 32233123200113311212 |
5 | 113044111000323420 |
6 | 2053211001510130 |
7 | 133121041011033 |
oct | 16573340276546 |
9 | 3524651212160 |
10 | 1013000011110 |
11 | 36067a10872a |
12 | 1443ab7a2346 |
13 | 746aa6725c9 |
14 | 3705abb638a |
15 | 1b53cbbb690 |
hex | ebdb817d66 |
1013000011110 has 64 divisors (see below), whose sum is σ = 2717509132800. Its totient is φ = 268515759456.
The previous prime is 1013000011097. The next prime is 1013000011183. The reversal of 1013000011110 is 111100003101.
It is a Harshad number since it is a multiple of its sum of digits (9).
1013000011110 is a modest number, since divided by 11110 gives 10130 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 1013000011092 and 1013000011101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11188000 + ... + 11278179.
It is an arithmetic number, because the mean of its divisors is an integer number (42461080200).
Almost surely, 21013000011110 is an apocalyptic number.
1013000011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1013000011110 is an abundant number, since it is smaller than the sum of its proper divisors (1704509121690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013000011110 is a wasteful number, since it uses less digits than its factorization.
1013000011110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22466362 (or 22466356 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 1013000011110 its reverse (111100003101), we get a palindrome (1124100014211).
The spelling of 1013000011110 in words is "one trillion, thirteen billion, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •