Base | Representation |
---|---|
bin | 1000110001000010… |
… | …0100000010000011 |
3 | 20001222212111212122 |
4 | 2030100210002003 |
5 | 14304401332011 |
6 | 1025300114455 |
7 | 112212314561 |
oct | 21420440203 |
9 | 6058774778 |
10 | 2353152131 |
11 | aa8325030 |
12 | 558095a2b |
13 | 2b6695215 |
14 | 184746a31 |
15 | db8c03db |
hex | 8c424083 |
2353152131 has 8 divisors (see below), whose sum is σ = 2568199728. Its totient is φ = 2138292000.
The previous prime is 2353152119. The next prime is 2353152211. The reversal of 2353152131 is 1312513532.
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-2353152131 is a prime.
It is a super-2 number, since 2×23531521312 = 11074649903259682322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2353152131.
It is not an unprimeable number, because it can be changed into a prime (2353152101) 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, 19940 + ... + 71441.
It is an arithmetic number, because the mean of its divisors is an integer number (321024966).
Almost surely, 22353152131 is an apocalyptic number.
2353152131 is a deficient number, since it is larger than the sum of its proper divisors (215047597).
2353152131 is a wasteful number, since it uses less digits than its factorization.
2353152131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93733.
The product of its digits is 2700, while the sum is 26.
The square root of 2353152131 is about 48509.2994280478. The cubic root of 2353152131 is about 1330.0970647308.
Adding to 2353152131 its reverse (1312513532), we get a palindrome (3665665663).
The spelling of 2353152131 in words is "two billion, three hundred fifty-three million, one hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •