Base | Representation |
---|---|
bin | 10011100010110111010… |
… | …000101111001000001111 |
3 | 11202101210020220120110012 |
4 | 103202313100233020033 |
5 | 134001134212223343 |
6 | 2505002540503435 |
7 | 166015244103455 |
oct | 23426720571017 |
9 | 4671706816405 |
10 | 1343104414223 |
11 | 478675477620 |
12 | 198376b4ab7b |
13 | 9986738bca0 |
14 | 4901417c9d5 |
15 | 24e0d228718 |
hex | 138b742f20f |
1343104414223 has 16 divisors (see below), whose sum is σ = 1604657174400. Its totient is φ = 1107977558880.
The previous prime is 1343104414199. The next prime is 1343104414241. The reversal of 1343104414223 is 3224144013431.
It is a cyclic number.
It is not a de Polignac number, because 1343104414223 - 26 = 1343104414159 is a prime.
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 1343104414223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1343104414273) 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, 79587653 + ... + 79604526.
It is an arithmetic number, because the mean of its divisors is an integer number (100291073400).
Almost surely, 21343104414223 is an apocalyptic number.
1343104414223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1343104414223 is a deficient number, since it is larger than the sum of its proper divisors (261552760177).
1343104414223 is a wasteful number, since it uses less digits than its factorization.
1343104414223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159192262.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 1343104414223 its reverse (3224144013431), we get a palindrome (4567248427654).
The spelling of 1343104414223 in words is "one trillion, three hundred forty-three billion, one hundred four million, four hundred fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •