Base | Representation |
---|---|
bin | 1000110010111100010… |
… | …0000101001100000110 |
3 | 112110001100121212002021 |
4 | 2030233010011030012 |
5 | 4433440021014332 |
6 | 153230501433354 |
7 | 13626506111554 |
oct | 2145704051406 |
9 | 473040555067 |
10 | 151113454342 |
11 | 590a5672954 |
12 | 2535370b85a |
13 | 11333161096 |
14 | 74575d2bd4 |
15 | 3de6721c97 |
hex | 232f105306 |
151113454342 has 8 divisors (see below), whose sum is σ = 240003721656. Its totient is φ = 71112213792.
The previous prime is 151113454339. The next prime is 151113454343. The reversal of 151113454342 is 243454311151.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (34), and also a Moran number because the ratio is a prime number: 4444513363 = 151113454342 / (1 + 5 + 1 + 1 + 1 + 3 + 4 + 5 + 4 + 3 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 151113454298 and 151113454307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151113454343) 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, 2222256648 + ... + 2222256715.
It is an arithmetic number, because the mean of its divisors is an integer number (30000465207).
Almost surely, 2151113454342 is an apocalyptic number.
151113454342 is a deficient number, since it is larger than the sum of its proper divisors (88890267314).
151113454342 is a wasteful number, since it uses less digits than its factorization.
151113454342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4444513382.
The product of its digits is 28800, while the sum is 34.
Adding to 151113454342 its reverse (243454311151), we get a palindrome (394567765493).
The spelling of 151113454342 in words is "one hundred fifty-one billion, one hundred thirteen million, four hundred fifty-four thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.743 sec. • engine limits •