Base | Representation |
---|---|
bin | 10011111111101100011… |
… | …000000111011101110001 |
3 | 11212100200121220010122201 |
4 | 103333230120013131301 |
5 | 140003033414444213 |
6 | 2531122401103201 |
7 | 201162331642534 |
oct | 23775430073561 |
9 | 4770617803581 |
10 | 1374060312433 |
11 | 48a810252076 |
12 | 1a2376027b01 |
13 | 9c75b7bc713 |
14 | 4a70d534a1b |
15 | 25b20c216dd |
hex | 13fec607771 |
1374060312433 has 8 divisors (see below), whose sum is σ = 1377155241000. Its totient is φ = 1370965879680.
The previous prime is 1374060312397. The next prime is 1374060312439. The reversal of 1374060312433 is 3342130604731.
It can be written as a sum of positive squares in 4 ways, for example, as 35605089 + 1374024707344 = 5967^2 + 1172188^2 .
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-1374060312433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1374060312392 and 1374060312401.
It is not an unprimeable number, because it can be changed into a prime (1374060312439) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5735943 + ... + 5970691.
It is an arithmetic number, because the mean of its divisors is an integer number (172144405125).
Almost surely, 21374060312433 is an apocalyptic number.
It is an amenable number.
1374060312433 is a deficient number, since it is larger than the sum of its proper divisors (3094928567).
1374060312433 is a wasteful number, since it uses less digits than its factorization.
1374060312433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247907.
The product of its (nonzero) digits is 108864, while the sum is 37.
The spelling of 1374060312433 in words is "one trillion, three hundred seventy-four billion, sixty million, three hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •