Base | Representation |
---|---|
bin | 1100101111011111110110… |
… | …0010011011011111111001 |
3 | 1211121100121212220121200200 |
4 | 3023313331202123133321 |
5 | 3314020232323412213 |
6 | 45444100445352413 |
7 | 2644125244136616 |
oct | 313677542333771 |
9 | 54540555817620 |
10 | 14010142013433 |
11 | 4511738a17475 |
12 | 16a3314268709 |
13 | 7a81c61a5027 |
14 | 3661473db50d |
15 | 1946814ae273 |
hex | cbdfd89b7f9 |
14010142013433 has 24 divisors (see below), whose sum is σ = 20448942240480. Its totient is φ = 9242483080320.
The previous prime is 14010142013407. The next prime is 14010142013453. The reversal of 14010142013433 is 33431024101041.
14010142013433 is a `hidden beast` number, since 1 + 4 + 0 + 10 + 14 + 201 + 3 + 433 = 666.
It is not a de Polignac number, because 14010142013433 - 29 = 14010142012921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14010142013397 and 14010142013406.
It is not an unprimeable number, because it can be changed into a prime (14010142013453) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10498063 + ... + 11757108.
It is an arithmetic number, because the mean of its divisors is an integer number (852039260020).
Almost surely, 214010142013433 is an apocalyptic number.
It is an amenable number.
14010142013433 is a deficient number, since it is larger than the sum of its proper divisors (6438800227047).
14010142013433 is a wasteful number, since it uses less digits than its factorization.
14010142013433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22255909 (or 22255906 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 14010142013433 its reverse (33431024101041), we get a palindrome (47441166114474).
The spelling of 14010142013433 in words is "fourteen trillion, ten billion, one hundred forty-two million, thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •