Base | Representation |
---|---|
bin | 1000110010101101100… |
… | …1101100111010111011 |
3 | 112102220002000022202000 |
4 | 2030223121230322323 |
5 | 4433323303410433 |
6 | 153220424512043 |
7 | 13625131633155 |
oct | 2145331547273 |
9 | 472802008660 |
10 | 151052013243 |
11 | 59073a1828a |
12 | 2533701b623 |
13 | 113234cb1c1 |
14 | 744d39bad5 |
15 | 3de1137113 |
hex | 232b66cebb |
151052013243 has 8 divisors (see below), whose sum is σ = 223780760400. Its totient is φ = 100701342144.
The previous prime is 151052013241. The next prime is 151052013247. The reversal of 151052013243 is 342310250151.
151052013243 is a `hidden beast` number, since 1 + 5 + 1 + 0 + 520 + 132 + 4 + 3 = 666.
It is not a de Polignac number, because 151052013243 - 21 = 151052013241 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 5594519009 = 151052013243 / (1 + 5 + 1 + 0 + 5 + 2 + 0 + 1 + 3 + 2 + 4 + 3).
It is not an unprimeable number, because it can be changed into a prime (151052013241) 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, 2797259478 + ... + 2797259531.
It is an arithmetic number, because the mean of its divisors is an integer number (27972595050).
Almost surely, 2151052013243 is an apocalyptic number.
151052013243 is a deficient number, since it is larger than the sum of its proper divisors (72728747157).
151052013243 is an equidigital number, since it uses as much as digits as its factorization.
151052013243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5594519018 (or 5594519012 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 151052013243 its reverse (342310250151), we get a palindrome (493362263394).
The spelling of 151052013243 in words is "one hundred fifty-one billion, fifty-two million, thirteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •