Base | Representation |
---|---|
bin | 1100110110100111010111… |
… | …1111101011101011100110 |
3 | 1212001001020210100011211000 |
4 | 3031221311333223223212 |
5 | 3323021200020011402 |
6 | 50020202310454130 |
7 | 2656014410143023 |
oct | 315516577535346 |
9 | 55031223304730 |
10 | 14132422032102 |
11 | 4559587895340 |
12 | 1702b5b664346 |
13 | 7b68b285976a |
14 | 36c02749054a |
15 | 19793b6dac1c |
hex | cda75febae6 |
14132422032102 has 32 divisors (see below), whose sum is σ = 34260417048960. Its totient is φ = 4282552130760.
The previous prime is 14132422032089. The next prime is 14132422032121. The reversal of 14132422032102 is 20123022423141.
14132422032102 is a `hidden beast` number, since 1 + 4 + 1 + 3 + 242 + 203 + 210 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11895977548 + ... + 11895978735.
It is an arithmetic number, because the mean of its divisors is an integer number (1070638032780).
Almost surely, 214132422032102 is an apocalyptic number.
14132422032102 is an abundant number, since it is smaller than the sum of its proper divisors (20127995016858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14132422032102 is a wasteful number, since it uses less digits than its factorization.
14132422032102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23791956305 (or 23791956299 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 14132422032102 its reverse (20123022423141), we get a palindrome (34255444455243).
The spelling of 14132422032102 in words is "fourteen trillion, one hundred thirty-two billion, four hundred twenty-two million, thirty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •