Base | Representation |
---|---|
bin | 100000101101111010… |
… | …111001010100100111 |
3 | 10100200021120122020022 |
4 | 200231322321110213 |
5 | 1033421304332411 |
6 | 24045533025355 |
7 | 2352362236616 |
oct | 405572712447 |
9 | 110607518208 |
10 | 35130152231 |
11 | 13998067369 |
12 | 698502525b |
13 | 340b193835 |
14 | 19b390987d |
15 | da91ddedb |
hex | 82deb9527 |
35130152231 has 32 divisors (see below), whose sum is σ = 38368028160. Its totient is φ = 32041984000.
The previous prime is 35130152191. The next prime is 35130152237. The reversal of 35130152231 is 13225103153.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-35130152231 is a prime.
It is a super-2 number, since 2×351301522312 (a number of 22 digits) 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 35130152231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (35130152237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21941831 + ... + 21943431.
It is an arithmetic number, because the mean of its divisors is an integer number (1199000880).
Almost surely, 235130152231 is an apocalyptic number.
35130152231 is a deficient number, since it is larger than the sum of its proper divisors (3237875929).
35130152231 is a wasteful number, since it uses less digits than its factorization.
35130152231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1975.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 35130152231 its reverse (13225103153), we get a palindrome (48355255384).
The spelling of 35130152231 in words is "thirty-five billion, one hundred thirty million, one hundred fifty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •