Base | Representation |
---|---|
bin | 10011110011101111001… |
… | …111010001010010010011 |
3 | 11211010120000000120222220 |
4 | 103303233033101102103 |
5 | 134300241144014443 |
6 | 2521200514032123 |
7 | 200226246121344 |
oct | 23635717212223 |
9 | 4733500016886 |
10 | 1361223423123 |
11 | 485323154143 |
12 | 19b992b78643 |
13 | 9b49415a325 |
14 | 49c527080cb |
15 | 2561dc8da83 |
hex | 13cef3d1493 |
1361223423123 has 8 divisors (see below), whose sum is σ = 1814979707136. Its totient is φ = 907474710600.
The previous prime is 1361223423097. The next prime is 1361223423169. The reversal of 1361223423123 is 3213243221631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1361223423123 - 212 = 1361223419027 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1361223423023) 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, 1459183 + ... + 2202648.
It is an arithmetic number, because the mean of its divisors is an integer number (226872463392).
Almost surely, 21361223423123 is an apocalyptic number.
1361223423123 is a deficient number, since it is larger than the sum of its proper divisors (453756284013).
1361223423123 is a wasteful number, since it uses less digits than its factorization.
1361223423123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3785745.
The product of its digits is 31104, while the sum is 33.
Adding to 1361223423123 its reverse (3213243221631), we get a palindrome (4574466644754).
It can be divided in two parts, 1361 and 223423123, that multiplied together give a palindrome (304078870403).
The spelling of 1361223423123 in words is "one trillion, three hundred sixty-one billion, two hundred twenty-three million, four hundred twenty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •