Base | Representation |
---|---|
bin | 10011010011010110111… |
… | …110011010101001001101 |
3 | 11200210211001010200001111 |
4 | 103103112332122221031 |
5 | 133213040343112303 |
6 | 2453211000412021 |
7 | 164555555116246 |
oct | 23232676325115 |
9 | 4623731120044 |
10 | 1326456613453 |
11 | 4716021a5494 |
12 | 1950ab777011 |
13 | 98113341aba |
14 | 482b517dccd |
15 | 24786921b6d |
hex | 134d6f9aa4d |
1326456613453 has 8 divisors (see below), whose sum is σ = 1331784580896. Its totient is φ = 1321128990000.
The previous prime is 1326456613429. The next prime is 1326456613459. The reversal of 1326456613453 is 3543166546231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1326456613453 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1326456613397 and 1326456613406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1326456613459) 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, 10015123 + ... + 10146703.
It is an arithmetic number, because the mean of its divisors is an integer number (166473072612).
Almost surely, 21326456613453 is an apocalyptic number.
It is an amenable number.
1326456613453 is a deficient number, since it is larger than the sum of its proper divisors (5327967443).
1326456613453 is a wasteful number, since it uses less digits than its factorization.
1326456613453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171995.
The product of its digits is 4665600, while the sum is 49.
The spelling of 1326456613453 in words is "one trillion, three hundred twenty-six billion, four hundred fifty-six million, six hundred thirteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •