Base | Representation |
---|---|
bin | 10010011001010101101… |
… | …101010011111000111011 |
3 | 11110212000100220210002000 |
4 | 102121111231103320323 |
5 | 131202444012420311 |
6 | 2404425112112043 |
7 | 160222010323065 |
oct | 22312555237073 |
9 | 4425010823060 |
10 | 1264158326331 |
11 | 44814346728a |
12 | 185004095623 |
13 | 922956bc304 |
14 | 45285386735 |
15 | 22d3c53a056 |
hex | 12655b53e3b |
1264158326331 has 16 divisors (see below), whose sum is σ = 1898482319520. Its totient is φ = 831227391360.
The previous prime is 1264158326317. The next prime is 1264158326359. The reversal of 1264158326331 is 1336238514621.
1264158326331 is a `hidden beast` number, since 1 + 2 + 6 + 4 + 1 + 5 + 8 + 3 + 2 + 633 + 1 = 666.
It is not a de Polignac number, because 1264158326331 - 27 = 1264158326203 is a prime.
It is a super-2 number, since 2×12641583263312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1264158326831) 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 15 ways as a sum of consecutive naturals, for example, 320687610 + ... + 320691551.
It is an arithmetic number, because the mean of its divisors is an integer number (118655144970).
Almost surely, 21264158326331 is an apocalyptic number.
1264158326331 is a deficient number, since it is larger than the sum of its proper divisors (634323993189).
1264158326331 is an equidigital number, since it uses as much as digits as its factorization.
1264158326331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641379243 (or 641379237 counting only the distinct ones).
The product of its digits is 622080, while the sum is 45.
The spelling of 1264158326331 in words is "one trillion, two hundred sixty-four billion, one hundred fifty-eight million, three hundred twenty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •