Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …01010011011101000111 |
3 | 10112121011201102221021110 |
4 | 32203110221103131013 |
5 | 112341000000310210 |
6 | 2043221010420103 |
7 | 132150634560234 |
oct | 16432451233507 |
9 | 3477151387243 |
10 | 1000000010055 |
11 | 356108a32502 |
12 | 141981b91633 |
13 | 733b82a02a7 |
14 | 3658644a78b |
15 | 1b02b769420 |
hex | e8d4a53747 |
1000000010055 has 8 divisors (see below), whose sum is σ = 1600000016112. Its totient is φ = 533333338688.
The previous prime is 1000000010047. The next prime is 1000000010069. The reversal of 1000000010055 is 5500100000001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000000010055 - 23 = 1000000010047 is a prime.
It is a super-2 number, since 2×10000000100552 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1000000010055.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33333333654 + ... + 33333333683.
It is an arithmetic number, because the mean of its divisors is an integer number (200000002014).
Almost surely, 21000000010055 is an apocalyptic number.
1000000010055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1000000010055 is a deficient number, since it is larger than the sum of its proper divisors (600000006057).
1000000010055 is an equidigital number, since it uses as much as digits as its factorization.
1000000010055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66666667345.
The product of its (nonzero) digits is 25, while the sum is 12.
Adding to 1000000010055 its reverse (5500100000001), we get a palindrome (6500100010056).
The spelling of 1000000010055 in words is "one trillion, ten thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •