Base | Representation |
---|---|
bin | 1001000110010100100111… |
… | …0011101011110000011111 |
3 | 1022102101122002111000210211 |
4 | 2101211021303223300133 |
5 | 2302402114040231402 |
6 | 33135512432313251 |
7 | 2051531553301210 |
oct | 221451163536037 |
9 | 38371562430724 |
10 | 10004217117727 |
11 | 3207845831a88 |
12 | 1156a740a2827 |
13 | 577516a48761 |
14 | 2682c723d407 |
15 | 1253752a44d7 |
hex | 91949cebc1f |
10004217117727 has 32 divisors (see below), whose sum is σ = 11999084580864. Its totient is φ = 8160078585600.
The previous prime is 10004217117701. The next prime is 10004217117751. The reversal of 10004217117727 is 72771171240001.
It is a cyclic number.
It is not a de Polignac number, because 10004217117727 - 215 = 10004217084959 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10004217117727.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10004017117727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47455368 + ... + 47665714.
It is an arithmetic number, because the mean of its divisors is an integer number (374971393152).
Almost surely, 210004217117727 is an apocalyptic number.
10004217117727 is a deficient number, since it is larger than the sum of its proper divisors (1994867463137).
10004217117727 is a wasteful number, since it uses less digits than its factorization.
10004217117727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214039.
The product of its (nonzero) digits is 38416, while the sum is 40.
Adding to 10004217117727 its reverse (72771171240001), we get a palindrome (82775388357728).
The spelling of 10004217117727 in words is "ten trillion, four billion, two hundred seventeen million, one hundred seventeen thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •