Base | Representation |
---|---|
bin | 10011100010111110110… |
… | …000111101100001110011 |
3 | 11202102010000210100110102 |
4 | 103202332300331201303 |
5 | 134001413424133243 |
6 | 2505023235023015 |
7 | 166021333120250 |
oct | 23427660754163 |
9 | 4672100710412 |
10 | 1343230302323 |
11 | 47872a540178 |
12 | 1983b113aa6b |
13 | 99887497ca0 |
14 | 49026b8c427 |
15 | 24e192e39b8 |
hex | 138bec3d873 |
1343230302323 has 32 divisors (see below), whose sum is σ = 1729429833600. Its totient is φ = 1014598480896.
The previous prime is 1343230302313. The next prime is 1343230302341. The reversal of 1343230302323 is 3232030323431.
It is not a de Polignac number, because 1343230302323 - 26 = 1343230302259 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is not an unprimeable number, because it can be changed into a prime (1343230302313) 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 31 ways as a sum of consecutive naturals, for example, 2624636 + ... + 3094377.
It is an arithmetic number, because the mean of its divisors is an integer number (54044682300).
Almost surely, 21343230302323 is an apocalyptic number.
1343230302323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1343230302323 is a deficient number, since it is larger than the sum of its proper divisors (386199531277).
1343230302323 is a wasteful number, since it uses less digits than its factorization.
1343230302323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5719151.
The product of its (nonzero) digits is 23328, while the sum is 29.
Adding to 1343230302323 its reverse (3232030323431), we get a palindrome (4575260625754).
The spelling of 1343230302323 in words is "one trillion, three hundred forty-three billion, two hundred thirty million, three hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •