Base | Representation |
---|---|
bin | 101101000100100… |
… | …1000001000011010 |
3 | 10220101201221021020 |
4 | 1122021020020122 |
5 | 11044124421132 |
6 | 410022423310 |
7 | 52322460321 |
oct | 13211101032 |
9 | 3811657236 |
10 | 1512342042 |
11 | 70674aa62 |
12 | 362591b36 |
13 | 1b1423b63 |
14 | 104bd70b8 |
15 | 8cb8652c |
hex | 5a24821a |
1512342042 has 8 divisors (see below), whose sum is σ = 3024684096. Its totient is φ = 504114012.
The previous prime is 1512342019. The next prime is 1512342043. The reversal of 1512342042 is 2402432151.
It is a sphenic number, since it is the product of 3 distinct primes.
1512342042 is an admirable number.
It is a super-3 number, since 3×15123420423 (a number of 29 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1512342043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126028498 + ... + 126028509.
It is an arithmetic number, because the mean of its divisors is an integer number (378085512).
Almost surely, 21512342042 is an apocalyptic number.
1512342042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1512342042 is a wasteful number, since it uses less digits than its factorization.
1512342042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252057012.
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 1512342042 is about 38888.8421272735. The cubic root of 1512342042 is about 1147.8452511284.
Adding to 1512342042 its reverse (2402432151), we get a palindrome (3914774193).
The spelling of 1512342042 in words is "one billion, five hundred twelve million, three hundred forty-two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •