Base | Representation |
---|---|
bin | 1011011010001110001010… |
… | …0100011110000011110011 |
3 | 1122102022002222122120102102 |
4 | 2312203202210132003303 |
5 | 3121014334030343233 |
6 | 42403050401211015 |
7 | 2433232262105420 |
oct | 266434244360363 |
9 | 48368088576372 |
10 | 12545105715443 |
11 | 3aa7393142984 |
12 | 14a73aa630a6b |
13 | 6cccc96138c2 |
14 | 31528750cd47 |
15 | 16b4d88c51e8 |
hex | b68e291e0f3 |
12545105715443 has 8 divisors (see below), whose sum is σ = 14471256794112. Its totient is φ = 10652452916616.
The previous prime is 12545105715431. The next prime is 12545105715479. The reversal of 12545105715443 is 34451750154521.
12545105715443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12545105715443 - 218 = 12545105453299 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12545105715403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8374569155 + ... + 8374570652.
It is an arithmetic number, because the mean of its divisors is an integer number (1808907099264).
Almost surely, 212545105715443 is an apocalyptic number.
12545105715443 is a deficient number, since it is larger than the sum of its proper divisors (1926151078669).
12545105715443 is a wasteful number, since it uses less digits than its factorization.
12545105715443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16749139921.
The product of its (nonzero) digits is 1680000, while the sum is 47.
Adding to 12545105715443 its reverse (34451750154521), we get a palindrome (46996855869964).
The spelling of 12545105715443 in words is "twelve trillion, five hundred forty-five billion, one hundred five million, seven hundred fifteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •