Base | Representation |
---|---|
bin | 1000110011010100000… |
… | …0010100011010100110 |
3 | 112110022022011222100021 |
4 | 2030311000110122212 |
5 | 4434141030201210 |
6 | 153244422105354 |
7 | 13632126260404 |
oct | 2146500243246 |
9 | 473268158307 |
10 | 151213131430 |
11 | 59146963809 |
12 | 25380b7b25a |
13 | 1134a9c08ca |
14 | 746693c474 |
15 | 3e00360bda |
hex | 23350146a6 |
151213131430 has 16 divisors (see below), whose sum is σ = 279539951760. Its totient is φ = 58850515872.
The previous prime is 151213131427. The next prime is 151213131497. The reversal of 151213131430 is 34131312151.
It is a super-2 number, since 2×1512131314302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 151213131395 and 151213131404.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 204341700 + ... + 204342439.
It is an arithmetic number, because the mean of its divisors is an integer number (17471246985).
Almost surely, 2151213131430 is an apocalyptic number.
151213131430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
151213131430 is a deficient number, since it is larger than the sum of its proper divisors (128326820330).
151213131430 is a wasteful number, since it uses less digits than its factorization.
151213131430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408684183.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 151213131430 its reverse (34131312151), we get a palindrome (185344443581).
The spelling of 151213131430 in words is "one hundred fifty-one billion, two hundred thirteen million, one hundred thirty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •