Base | Representation |
---|---|
bin | 11110111110011111110… |
… | …10110110001011110100 |
3 | 10202202021001022220010002 |
4 | 33133033322312023310 |
5 | 114414234334411431 |
6 | 2132541540050432 |
7 | 136616316125645 |
oct | 17371772661364 |
9 | 3682231286102 |
10 | 1064345232116 |
11 | 380428155181 |
12 | 15233b093a18 |
13 | 794a102139a |
14 | 3972c0396cc |
15 | 1ca456d53cb |
hex | f7cfeb62f4 |
1064345232116 has 12 divisors (see below), whose sum is σ = 1864271669988. Its totient is φ = 531696183552.
The previous prime is 1064345232101. The next prime is 1064345232131. The reversal of 1064345232116 is 6112325434601.
It is an interprime number because it is at equal distance from previous prime (1064345232101) and next prime (1064345232131).
It can be written as a sum of positive squares in 2 ways, for example, as 189184982116 + 875160250000 = 434954^2 + 935500^2 .
It is a super-2 number, since 2×10643452321162 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1064345232116.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119103101 + ... + 119112036.
It is an arithmetic number, because the mean of its divisors is an integer number (155355972499).
Almost surely, 21064345232116 is an apocalyptic number.
It is an amenable number.
1064345232116 is a deficient number, since it is larger than the sum of its proper divisors (799926437872).
1064345232116 is a wasteful number, since it uses less digits than its factorization.
1064345232116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238216258 (or 238216256 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 1064345232116 in words is "one trillion, sixty-four billion, three hundred forty-five million, two hundred thirty-two thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •