Base | Representation |
---|---|
bin | 10010001111111111100… |
… | …000100010111101010101 |
3 | 11102220002221011222211001 |
4 | 102033333200202331111 |
5 | 131021420241030023 |
6 | 2400045155143301 |
7 | 156415213566136 |
oct | 22177740427525 |
9 | 4386087158731 |
10 | 1254122205013 |
11 | 443963320847 |
12 | 183082ba4b31 |
13 | 913563958a2 |
14 | 449b24ddc8d |
15 | 229513e46ad |
hex | 123ff822f55 |
1254122205013 has 8 divisors (see below), whose sum is σ = 1264742009856. Its totient is φ = 1243544626800.
The previous prime is 1254122204999. The next prime is 1254122205019. The reversal of 1254122205013 is 3105022214521.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1254122205013 - 233 = 1245532270421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1254122205019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10497006 + ... + 10615807.
It is an arithmetic number, because the mean of its divisors is an integer number (158092751232).
Almost surely, 21254122205013 is an apocalyptic number.
It is an amenable number.
1254122205013 is a deficient number, since it is larger than the sum of its proper divisors (10619804843).
1254122205013 is a wasteful number, since it uses less digits than its factorization.
1254122205013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21113315.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 1254122205013 its reverse (3105022214521), we get a palindrome (4359144419534).
The spelling of 1254122205013 in words is "one trillion, two hundred fifty-four billion, one hundred twenty-two million, two hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •