Base | Representation |
---|---|
bin | 11010010111011010… |
… | …01000001100101110 |
3 | 1100112111011200100200 |
4 | 31023231020030232 |
5 | 212442141220100 |
6 | 10300331134330 |
7 | 1010526466032 |
oct | 151355101456 |
9 | 40474150320 |
10 | 14155023150 |
11 | 6004161444 |
12 | 28b05a43a6 |
13 | 1447779258 |
14 | 983d0c1c2 |
15 | 57ca55e00 |
hex | 34bb4832e |
14155023150 has 72 divisors (see below), whose sum is σ = 39256636224. Its totient is φ = 3652905600.
The previous prime is 14155023137. The next prime is 14155023151. The reversal of 14155023150 is 5132055141.
14155023150 is a `hidden beast` number, since 1 + 4 + 1 + 5 + 502 + 3 + 150 = 666.
14155023150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14155023151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 493399 + ... + 521298.
Almost surely, 214155023150 is an apocalyptic number.
14155023150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14155023150 is an abundant number, since it is smaller than the sum of its proper divisors (25101613074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14155023150 is a wasteful number, since it uses less digits than its factorization.
14155023150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1014746 (or 1014738 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 14155023150 its reverse (5132055141), we get a palindrome (19287078291).
The spelling of 14155023150 in words is "fourteen billion, one hundred fifty-five million, twenty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •