Base | Representation |
---|---|
bin | 1000110011011011101… |
… | …0001001110110000001 |
3 | 112110101112021121102001 |
4 | 2030312322021312001 |
5 | 4434222214212242 |
6 | 153251522424001 |
7 | 13632664611031 |
oct | 2146672116601 |
9 | 473345247361 |
10 | 151245069697 |
11 | 59162998477 |
12 | 2538b802001 |
13 | 113544c3ba7 |
14 | 746ac938c1 |
15 | 3e0306deb7 |
hex | 2336e89d81 |
151245069697 has 4 divisors (see below), whose sum is σ = 151253374896. Its totient is φ = 151236764500.
The previous prime is 151245069691. The next prime is 151245069739. The reversal of 151245069697 is 796960542151.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 796960542151 = 2707 ⋅294407293.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151245069697 is a prime.
It is a super-2 number, since 2×1512450696972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151245069691) 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, 4125223 + ... + 4161724.
It is an arithmetic number, because the mean of its divisors is an integer number (37813343724).
Almost surely, 2151245069697 is an apocalyptic number.
It is an amenable number.
151245069697 is a deficient number, since it is larger than the sum of its proper divisors (8305199).
151245069697 is an equidigital number, since it uses as much as digits as its factorization.
151245069697 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8305198.
The product of its (nonzero) digits is 4082400, while the sum is 55.
The spelling of 151245069697 in words is "one hundred fifty-one billion, two hundred forty-five million, sixty-nine thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •