Base | Representation |
---|---|
bin | 1101000110111100110011… |
… | …0110011100011100100001 |
3 | 1220000212121101022211022120 |
4 | 3101233030312130130201 |
5 | 3342120412314234213 |
6 | 50353133103054453 |
7 | 3015210603321255 |
oct | 321571466343441 |
9 | 56025541284276 |
10 | 14413052102433 |
11 | 46575a51897a6 |
12 | 1749419ba1429 |
13 | 8071b66a730a |
14 | 37b849c80265 |
15 | 19edb35db423 |
hex | d1bccd9c721 |
14413052102433 has 16 divisors (see below), whose sum is σ = 19327065139200. Its totient is φ = 9553957897680.
The previous prime is 14413052102389. The next prime is 14413052102441. The reversal of 14413052102433 is 33420125031441.
It is not a de Polignac number, because 14413052102433 - 28 = 14413052102177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14413052102394 and 14413052102403.
It is not an unprimeable number, because it can be changed into a prime (14413052102633) 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, 10299693 + ... + 11615066.
It is an arithmetic number, because the mean of its divisors is an integer number (1207941571200).
Almost surely, 214413052102433 is an apocalyptic number.
It is an amenable number.
14413052102433 is a deficient number, since it is larger than the sum of its proper divisors (4914013036767).
14413052102433 is a wasteful number, since it uses less digits than its factorization.
14413052102433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21916012.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 14413052102433 its reverse (33420125031441), we get a palindrome (47833177133874).
The spelling of 14413052102433 in words is "fourteen trillion, four hundred thirteen billion, fifty-two million, one hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •