Base | Representation |
---|---|
bin | 1001011010000100001101… |
… | …0111011111100001011011 |
3 | 1100121211011010111222202210 |
4 | 2112201003113133201123 |
5 | 2323431301314340132 |
6 | 33555410404530203 |
7 | 2115200243642346 |
oct | 226410327374133 |
9 | 40554133458683 |
10 | 10343411480667 |
11 | 3328686146271 |
12 | 11b07576b0963 |
13 | 5a04c1a51ca5 |
14 | 27a8a395745d |
15 | 12e0c885cbcc |
hex | 968435df85b |
10343411480667 has 16 divisors (see below), whose sum is σ = 14603546944512. Its totient is φ = 6489502039680.
The previous prime is 10343411480663. The next prime is 10343411480683. The reversal of 10343411480667 is 76608411434301.
It is not a de Polignac number, because 10343411480667 - 22 = 10343411480663 is a prime.
It is a super-2 number, since 2×103434114806672 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10343411480663) 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, 6830959 + ... + 8206632.
It is an arithmetic number, because the mean of its divisors is an integer number (912721684032).
Almost surely, 210343411480667 is an apocalyptic number.
10343411480667 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
10343411480667 is a deficient number, since it is larger than the sum of its proper divisors (4260135463845).
10343411480667 is a wasteful number, since it uses less digits than its factorization.
10343411480667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15051098.
The product of its (nonzero) digits is 1161216, while the sum is 48.
The spelling of 10343411480667 in words is "ten trillion, three hundred forty-three billion, four hundred eleven million, four hundred eighty thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •