Base | Representation |
---|---|
bin | 1100110100111011000011… |
… | …0001001111100000000011 |
3 | 1211221021012020122010101120 |
4 | 3031032300301033200003 |
5 | 3322032121343100311 |
6 | 45554553025203323 |
7 | 2653634665232532 |
oct | 315166061174003 |
9 | 54837166563346 |
10 | 14103343331331 |
11 | 4548215701031 |
12 | 16b93a5190543 |
13 | 7b3c2a307947 |
14 | 36a869548319 |
15 | 196cd88e9706 |
hex | cd3b0c4f803 |
14103343331331 has 16 divisors (see below), whose sum is σ = 19927348025760. Its totient is φ = 8856599118080.
The previous prime is 14103343331243. The next prime is 14103343331353. The reversal of 14103343331331 is 13313334330141.
It is a cyclic number.
It is not a de Polignac number, because 14103343331331 - 217 = 14103343200259 is a prime.
It is a super-2 number, since 2×141033433313312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14103343331292 and 14103343331301.
It is not an unprimeable number, because it can be changed into a prime (14103343331731) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1976915880 + ... + 1976923013.
It is an arithmetic number, because the mean of its divisors is an integer number (1245459251610).
Almost surely, 214103343331331 is an apocalyptic number.
14103343331331 is a deficient number, since it is larger than the sum of its proper divisors (5824004694429).
14103343331331 is a wasteful number, since it uses less digits than its factorization.
14103343331331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3953838966.
The product of its (nonzero) digits is 34992, while the sum is 33.
Adding to 14103343331331 its reverse (13313334330141), we get a palindrome (27416677661472).
The spelling of 14103343331331 in words is "fourteen trillion, one hundred three billion, three hundred forty-three million, three hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •