Base | Representation |
---|---|
bin | 1101001000001100000101… |
… | …0011000010111111011000 |
3 | 1220002220112111022000220121 |
4 | 3102003001103002333120 |
5 | 3342443003234011412 |
6 | 50411012513003024 |
7 | 3016563142024630 |
oct | 322030123027730 |
9 | 56086474260817 |
10 | 14434333110232 |
11 | 4665625813952 |
12 | 1751578b53474 |
13 | 8091c859a419 |
14 | 37c8a83416c0 |
15 | 1a070ba45107 |
hex | d20c14c2fd8 |
14434333110232 has 16 divisors (see below), whose sum is σ = 30930713807760. Its totient is φ = 6186142761504.
The previous prime is 14434333110209. The next prime is 14434333110269. The reversal of 14434333110232 is 23201133343441.
It is a super-3 number, since 3×144343331102323 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128877974143 + ... + 128877974254.
It is an arithmetic number, because the mean of its divisors is an integer number (1933169612985).
Almost surely, 214434333110232 is an apocalyptic number.
It is an amenable number.
14434333110232 is an abundant number, since it is smaller than the sum of its proper divisors (16496380697528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14434333110232 is a wasteful number, since it uses less digits than its factorization.
14434333110232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257755948410 (or 257755948406 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 34.
Adding to 14434333110232 its reverse (23201133343441), we get a palindrome (37635466453673).
The spelling of 14434333110232 in words is "fourteen trillion, four hundred thirty-four billion, three hundred thirty-three million, one hundred ten thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •