Base | Representation |
---|---|
bin | 1000110011000101011… |
… | …1101010111010101001 |
3 | 112110011001102111101002 |
4 | 2030301113222322221 |
5 | 4434024422102131 |
6 | 153234403004345 |
7 | 13630456011533 |
oct | 2146127527251 |
9 | 473131374332 |
10 | 151152144041 |
11 | 59115499008 |
12 | 253646696b5 |
13 | 1133b1893b2 |
14 | 745c7c4853 |
15 | 3de9d156cb |
hex | 23315eaea9 |
151152144041 has 8 divisors (see below), whose sum is σ = 153429072000. Its totient is φ = 148884306480.
The previous prime is 151152144037. The next prime is 151152144049. The reversal of 151152144041 is 140441251151.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 151152144041 - 22 = 151152144037 is a prime.
It is a super-4 number, since 4×1511521440414 (a number of 46 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151152143995 and 151152144013.
It is not an unprimeable number, because it can be changed into a prime (151152144049) 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, 2239091 + ... + 2305608.
It is an arithmetic number, because the mean of its divisors is an integer number (19178634000).
Almost surely, 2151152144041 is an apocalyptic number.
It is an amenable number.
151152144041 is a deficient number, since it is larger than the sum of its proper divisors (2276927959).
151152144041 is an equidigital number, since it uses as much as digits as its factorization.
151152144041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4545199.
The product of its (nonzero) digits is 3200, while the sum is 29.
Adding to 151152144041 its reverse (140441251151), we get a palindrome (291593395192).
The spelling of 151152144041 in words is "one hundred fifty-one billion, one hundred fifty-two million, one hundred forty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •