Base | Representation |
---|---|
bin | 1001001100101110100111… |
… | …0010111010111100010001 |
3 | 1022210220201020122211111220 |
4 | 2103023221302322330101 |
5 | 2311203014004022422 |
6 | 33302233424355253 |
7 | 2062506113601336 |
oct | 223135162727421 |
9 | 38726636584456 |
10 | 10114275454737 |
11 | 324a4928a75a3 |
12 | 117426a475b29 |
13 | 584a0635c6ac |
14 | 26d76808a98d |
15 | 128167571e5c |
hex | 932e9cbaf11 |
10114275454737 has 8 divisors (see below), whose sum is σ = 13496602551936. Its totient is φ = 6737399330352.
The previous prime is 10114275454663. The next prime is 10114275454753. The reversal of 10114275454737 is 73745457241101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10114275454737 - 212 = 10114275450641 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10114275454737.
It is not an unprimeable number, because it can be changed into a prime (10114275454937) 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 7 ways as a sum of consecutive naturals, for example, 1362738873 + ... + 1362746294.
It is an arithmetic number, because the mean of its divisors is an integer number (1687075318992).
Almost surely, 210114275454737 is an apocalyptic number.
It is an amenable number.
10114275454737 is a deficient number, since it is larger than the sum of its proper divisors (3382327097199).
10114275454737 is a wasteful number, since it uses less digits than its factorization.
10114275454737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2725486407.
The product of its (nonzero) digits is 3292800, while the sum is 51.
The spelling of 10114275454737 in words is "ten trillion, one hundred fourteen billion, two hundred seventy-five million, four hundred fifty-four thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •