Base | Representation |
---|---|
bin | 11110111110011100001… |
… | …00010000001011011011 |
3 | 10202202011212211102111001 |
4 | 33133032010100023123 |
5 | 114414203410042301 |
6 | 2132534505445431 |
7 | 136615460644306 |
oct | 17371604201333 |
9 | 3682155742431 |
10 | 1064314143451 |
11 | 380411650869 |
12 | 1523307a0877 |
13 | 79497757a20 |
14 | 39727c65b3d |
15 | 1ca42ae3c01 |
hex | f7ce1102db |
1064314143451 has 16 divisors (see below), whose sum is σ = 1147722397920. Its totient is φ = 981126478080.
The previous prime is 1064314143439. The next prime is 1064314143463. The reversal of 1064314143451 is 1543414134601.
It is an interprime number because it is at equal distance from previous prime (1064314143439) and next prime (1064314143463).
It is a cyclic number.
It is not a de Polignac number, because 1064314143451 - 217 = 1064314012379 is a prime.
It is a super-2 number, since 2×10643141434512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1064314143451.
It is not an unprimeable number, because it can be changed into a prime (1064314143481) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31620591 + ... + 31654231.
It is an arithmetic number, because the mean of its divisors is an integer number (71732649870).
Almost surely, 21064314143451 is an apocalyptic number.
1064314143451 is a deficient number, since it is larger than the sum of its proper divisors (83408254469).
1064314143451 is a wasteful number, since it uses less digits than its factorization.
1064314143451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36846.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 1064314143451 in words is "one trillion, sixty-four billion, three hundred fourteen million, one hundred forty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •