Base | Representation |
---|---|
bin | 1100111010101110010011… |
… | …1101111100011010001001 |
3 | 1212021210102201111022022200 |
4 | 3032223210331330122021 |
5 | 3330200222322332131 |
6 | 50112434124510413 |
7 | 2664063443213250 |
oct | 316534475743211 |
9 | 55253381438280 |
10 | 14203003324041 |
11 | 4586507117674 |
12 | 17147790ab409 |
13 | 7c045054c62c |
14 | 37160137d797 |
15 | 1996bcd712e6 |
hex | ceae4f7c689 |
14203003324041 has 96 divisors (see below), whose sum is σ = 25103385216000. Its totient is φ = 7557068098944.
The previous prime is 14203003324021. The next prime is 14203003324049. The reversal of 14203003324041 is 14042330030241.
14203003324041 is a `hidden beast` number, since 1 + 4 + 20 + 300 + 332 + 4 + 0 + 4 + 1 = 666.
It is not a de Polignac number, because 14203003324041 - 210 = 14203003323017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14203003323996 and 14203003324014.
It is not an unprimeable number, because it can be changed into a prime (14203003324049) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 435939490 + ... + 435972068.
It is an arithmetic number, because the mean of its divisors is an integer number (261493596000).
Almost surely, 214203003324041 is an apocalyptic number.
It is an amenable number.
14203003324041 is a deficient number, since it is larger than the sum of its proper divisors (10900381891959).
14203003324041 is a wasteful number, since it uses less digits than its factorization.
14203003324041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38843 (or 38840 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 14203003324041 its reverse (14042330030241), we get a palindrome (28245333354282).
The spelling of 14203003324041 in words is "fourteen trillion, two hundred three billion, three million, three hundred twenty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •