Base | Representation |
---|---|
bin | 11101011110100010111… |
… | …00100111111101100001 |
3 | 10120211021221200210021012 |
4 | 32233101130213331201 |
5 | 113043234300201132 |
6 | 2053142132510305 |
7 | 133113621426611 |
oct | 16572134477541 |
9 | 3524257623235 |
10 | 1012831256417 |
11 | 3605a2926842 |
12 | 14436317b395 |
13 | 74681708066 |
14 | 37042608a41 |
15 | 1b52ce850b2 |
hex | ebd1727f61 |
1012831256417 has 8 divisors (see below), whose sum is σ = 1101393608616. Its totient is φ = 927489353472.
The previous prime is 1012831256413. The next prime is 1012831256467. The reversal of 1012831256417 is 7146521382101.
It can be written as a sum of positive squares in 4 ways, for example, as 220501619776 + 792329636641 = 469576^2 + 890129^2 .
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 1012831256417 - 22 = 1012831256413 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012831256413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 805111658 + ... + 805112915.
It is an arithmetic number, because the mean of its divisors is an integer number (137674201077).
Almost surely, 21012831256417 is an apocalyptic number.
1012831256417 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1012831256417 is a deficient number, since it is larger than the sum of its proper divisors (88562352199).
1012831256417 is a wasteful number, since it uses less digits than its factorization.
1012831256417 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1610224627.
The product of its (nonzero) digits is 80640, while the sum is 41.
The spelling of 1012831256417 in words is "one trillion, twelve billion, eight hundred thirty-one million, two hundred fifty-six thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •