Base | Representation |
---|---|
bin | 1100110110100110010111… |
… | …1001110010001000110110 |
3 | 1212001000112222022200022102 |
4 | 3031221211321302020312 |
5 | 3323020121411101410 |
6 | 50020115424102102 |
7 | 2656004621265614 |
oct | 315514571621066 |
9 | 55030488280272 |
10 | 14132152050230 |
11 | 4559459453a25 |
12 | 1702aa5164932 |
13 | 7b686b93bc86 |
14 | 36bddd6926b4 |
15 | 197922b5b2a5 |
hex | cda65e72236 |
14132152050230 has 32 divisors (see below), whose sum is σ = 25487919470880. Its totient is φ = 5641748409600.
The previous prime is 14132152050223. The next prime is 14132152050239. The reversal of 14132152050230 is 3205025123141.
It is a junction number, because it is equal to n+sod(n) for n = 14132152050193 and 14132152050202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14132152050239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12215717 + ... + 13322463.
It is an arithmetic number, because the mean of its divisors is an integer number (796497483465).
Almost surely, 214132152050230 is an apocalyptic number.
14132152050230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14132152050230 is a deficient number, since it is larger than the sum of its proper divisors (11355767420650).
14132152050230 is a wasteful number, since it uses less digits than its factorization.
14132152050230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1109264.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 14132152050230 its reverse (3205025123141), we get a palindrome (17337177173371).
The spelling of 14132152050230 in words is "fourteen trillion, one hundred thirty-two billion, one hundred fifty-two million, fifty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •