Base | Representation |
---|---|
bin | 1100001000000011… |
… | …1111100010010111 |
3 | 22101211221011122122 |
4 | 3002000333202113 |
5 | 23131242241101 |
6 | 1254554450155 |
7 | 143443245656 |
oct | 30200774227 |
9 | 8354834578 |
10 | 3255040151 |
11 | 1420426930 |
12 | 76a13395b |
13 | 3cb4a007c |
14 | 22c43519d |
15 | 140b7151b |
hex | c203f897 |
3255040151 has 4 divisors (see below), whose sum is σ = 3550952904. Its totient is φ = 2959127400.
The previous prime is 3255040147. The next prime is 3255040169. The reversal of 3255040151 is 1510405523.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1510405523 = 11 ⋅137309593.
It is a cyclic number.
It is not a de Polignac number, because 3255040151 - 22 = 3255040147 is a prime.
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 3255040151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3255040111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147956360 + ... + 147956381.
It is an arithmetic number, because the mean of its divisors is an integer number (887738226).
Almost surely, 23255040151 is an apocalyptic number.
3255040151 is a deficient number, since it is larger than the sum of its proper divisors (295912753).
3255040151 is a wasteful number, since it uses less digits than its factorization.
3255040151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295912752.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 3255040151 is about 57052.9591782933. The cubic root of 3255040151 is about 1482.0133529490.
Adding to 3255040151 its reverse (1510405523), we get a palindrome (4765445674).
The spelling of 3255040151 in words is "three billion, two hundred fifty-five million, forty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •