Base | Representation |
---|---|
bin | 101000010011000… |
… | …0000010011110111 |
3 | 10111020021211102010 |
4 | 1100212000103313 |
5 | 10232121440043 |
6 | 342101015303 |
7 | 45336000123 |
oct | 12046002367 |
9 | 3436254363 |
10 | 1352140023 |
11 | 63427a8a3 |
12 | 3189b4533 |
13 | 187192470 |
14 | cb814583 |
15 | 7da8e133 |
hex | 509804f7 |
1352140023 has 8 divisors (see below), whose sum is σ = 1941534448. Its totient is φ = 832086144.
The previous prime is 1352140021. The next prime is 1352140043. The reversal of 1352140023 is 3200412531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1352140023 - 21 = 1352140021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1352140021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17335090 + ... + 17335167.
It is an arithmetic number, because the mean of its divisors is an integer number (242691806).
Almost surely, 21352140023 is an apocalyptic number.
1352140023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1352140023 is a deficient number, since it is larger than the sum of its proper divisors (589394425).
1352140023 is a wasteful number, since it uses less digits than its factorization.
1352140023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34670273.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 1352140023 is about 36771.4566341884. The cubic root of 1352140023 is about 1105.7931347728.
Adding to 1352140023 its reverse (3200412531), we get a palindrome (4552552554).
The spelling of 1352140023 in words is "one billion, three hundred fifty-two million, one hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •