Base | Representation |
---|---|
bin | 1000110100000001000… |
… | …1001011100100010100 |
3 | 112110210110202121212200 |
4 | 2031000101023210110 |
5 | 4440032414213022 |
6 | 153315252244500 |
7 | 13636612424211 |
oct | 2150021134424 |
9 | 473713677780 |
10 | 151402101012 |
11 | 592335a2418 |
12 | 25414310730 |
13 | 1137abb5326 |
14 | 7483a8cb08 |
15 | 3e11c3bbac |
hex | 234044b914 |
151402101012 has 72 divisors (see below), whose sum is σ = 410143808256. Its totient is φ = 46968444864.
The previous prime is 151402100953. The next prime is 151402101013. The reversal of 151402101012 is 210101204151.
151402101012 is a `hidden beast` number, since 151 + 402 + 10 + 101 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151402101013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2440348 + ... + 2501619.
Almost surely, 2151402101012 is an apocalyptic number.
151402101012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
151402101012 is an abundant number, since it is smaller than the sum of its proper divisors (258741707244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151402101012 is a wasteful number, since it uses less digits than its factorization.
151402101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4942037 (or 4942032 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
Adding to 151402101012 its reverse (210101204151), we get a palindrome (361503305163).
The spelling of 151402101012 in words is "one hundred fifty-one billion, four hundred two million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •