Base | Representation |
---|---|
bin | 11101011101010100010… |
… | …01110011100111110001 |
3 | 10120202121000012200221221 |
4 | 32232222021303213301 |
5 | 113040412013341032 |
6 | 2052552502545041 |
7 | 133061365101355 |
oct | 16565211634761 |
9 | 3522530180857 |
10 | 1012172012017 |
11 | 360294793761 |
12 | 1441ba438181 |
13 | 745a7c6840a |
14 | 36dbcc3d465 |
15 | 1b4e0163597 |
hex | ebaa2739f1 |
1012172012017 has 8 divisors (see below), whose sum is σ = 1047289602240. Its totient is φ = 977068762320.
The previous prime is 1012172011997. The next prime is 1012172012053. The reversal of 1012172012017 is 7102102712101.
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 1012172012017 - 219 = 1012171487729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012172011982 and 1012172012000.
It is not an unprimeable number, because it can be changed into a prime (1012172012317) 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, 3441423 + ... + 3723940.
It is an arithmetic number, because the mean of its divisors is an integer number (130911200280).
Almost surely, 21012172012017 is an apocalyptic number.
It is an amenable number.
1012172012017 is a deficient number, since it is larger than the sum of its proper divisors (35117590223).
1012172012017 is an equidigital number, since it uses as much as digits as its factorization.
1012172012017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7170263.
The product of its (nonzero) digits is 392, while the sum is 25.
Adding to 1012172012017 its reverse (7102102712101), we get a palindrome (8114274724118).
The spelling of 1012172012017 in words is "one trillion, twelve billion, one hundred seventy-two million, twelve thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •