Base | Representation |
---|---|
bin | 1101000010000111110111… |
… | …1001001110110010010111 |
3 | 1212201221112220200200112212 |
4 | 3100201331321032302113 |
5 | 3334241043000213411 |
6 | 50251100113504035 |
7 | 3006213544123445 |
oct | 320417571166227 |
9 | 55657486620485 |
10 | 14330123054231 |
11 | 4625409973426 |
12 | 173533527201b |
13 | 7cc42b7a0aaa |
14 | 3778200cbb95 |
15 | 19cb5cde168b |
hex | d087de4ec97 |
14330123054231 has 4 divisors (see below), whose sum is σ = 14343233872392. Its totient is φ = 14317012236072.
The previous prime is 14330123054173. The next prime is 14330123054237. The reversal of 14330123054231 is 13245032103341.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14330123054231 is a prime.
It is a super-2 number, since 2×143301230542312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14330123054237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6555407441 + ... + 6555409626.
It is an arithmetic number, because the mean of its divisors is an integer number (3585808468098).
Almost surely, 214330123054231 is an apocalyptic number.
14330123054231 is a deficient number, since it is larger than the sum of its proper divisors (13110818161).
14330123054231 is a wasteful number, since it uses less digits than its factorization.
14330123054231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13110818160.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 14330123054231 its reverse (13245032103341), we get a palindrome (27575155157572).
The spelling of 14330123054231 in words is "fourteen trillion, three hundred thirty billion, one hundred twenty-three million, fifty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •