Base | Representation |
---|---|
bin | 10000100000001000100… |
… | …000001111000110100110 |
3 | 11000102002101110202001110 |
4 | 100200020200033012212 |
5 | 122034430043044332 |
6 | 2224543040205450 |
7 | 144633632151300 |
oct | 20401040170646 |
9 | 4012071422043 |
10 | 1134014034342 |
11 | 3a7a293a4482 |
12 | 163943009886 |
13 | 82c24966a07 |
14 | 3cc5aa7a970 |
15 | 1e771bc34cc |
hex | 1080880f1a6 |
1134014034342 has 192 divisors, whose sum is σ = 2796148574208. Its totient is φ = 305270784000.
The previous prime is 1134014034313. The next prime is 1134014034407. The reversal of 1134014034342 is 2434304104311.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 63269542 + ... + 63287462.
It is an arithmetic number, because the mean of its divisors is an integer number (14563273824).
Almost surely, 21134014034342 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1134014034342, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1398074287104).
1134014034342 is an abundant number, since it is smaller than the sum of its proper divisors (1662134539866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1134014034342 is a wasteful number, since it uses less digits than its factorization.
1134014034342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18155 (or 18148 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 1134014034342 its reverse (2434304104311), we get a palindrome (3568318138653).
The spelling of 1134014034342 in words is "one trillion, one hundred thirty-four billion, fourteen million, thirty-four thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.892 sec. • engine limits •