Base | Representation |
---|---|
bin | 101000011110000… |
… | …0100001010001001 |
3 | 10111122011122002201 |
4 | 1100330010022021 |
5 | 10240112013303 |
6 | 342425000201 |
7 | 45436104022 |
oct | 12074041211 |
9 | 3448148081 |
10 | 1357922953 |
11 | 63756a682 |
12 | 31a923061 |
13 | 18843870a |
14 | cc4bbc49 |
15 | 7e33281d |
hex | 50f04289 |
1357922953 has 8 divisors (see below), whose sum is σ = 1362961728. Its totient is φ = 1352894544.
The previous prime is 1357922947. The next prime is 1357922959. The reversal of 1357922953 is 3592297531.
It is an interprime number because it is at equal distance from previous prime (1357922947) and next prime (1357922959).
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-1357922953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1357922959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 336375 + ... + 340387.
It is an arithmetic number, because the mean of its divisors is an integer number (170370216).
Almost surely, 21357922953 is an apocalyptic number.
It is an amenable number.
1357922953 is a deficient number, since it is larger than the sum of its proper divisors (5038775).
1357922953 is an equidigital number, since it uses as much as digits as its factorization.
1357922953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5183.
The product of its digits is 510300, while the sum is 46.
The square root of 1357922953 is about 36850.0061465395. The cubic root of 1357922953 is about 1107.3673379646.
The spelling of 1357922953 in words is "one billion, three hundred fifty-seven million, nine hundred twenty-two thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •