Base | Representation |
---|---|
bin | 10100110110101011100… |
… | …010101100110100111101 |
3 | 12002000002100110012210102 |
4 | 110312223202230310331 |
5 | 141434443120010023 |
6 | 3014205155450445 |
7 | 205352414642300 |
oct | 24665342546475 |
9 | 5060070405712 |
10 | 1433102110013 |
11 | 502858864502 |
12 | 1b18b2bb6a25 |
13 | a51aa885512 |
14 | 4d510a3ab37 |
15 | 2742929c628 |
hex | 14dab8acd3d |
1433102110013 has 24 divisors (see below), whose sum is σ = 1721024722944. Its totient is φ = 1188630828000.
The previous prime is 1433102110007. The next prime is 1433102110051. The reversal of 1433102110013 is 3100112013341.
It is not a de Polignac number, because 1433102110013 - 26 = 1433102109949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1433102110073) 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 23 ways as a sum of consecutive naturals, for example, 17505131 + ... + 17586807.
It is an arithmetic number, because the mean of its divisors is an integer number (71709363456).
Almost surely, 21433102110013 is an apocalyptic number.
It is an amenable number.
1433102110013 is a deficient number, since it is larger than the sum of its proper divisors (287922612931).
1433102110013 is a wasteful number, since it uses less digits than its factorization.
1433102110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93273 (or 93266 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1433102110013 its reverse (3100112013341), we get a palindrome (4533214123354).
The spelling of 1433102110013 in words is "one trillion, four hundred thirty-three billion, one hundred two million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.461 sec. • engine limits •