Base | Representation |
---|---|
bin | 10000010110110011101… |
… | …011101010001101111010 |
3 | 10222110020120020110202002 |
4 | 100112303223222031322 |
5 | 121403423230443114 |
6 | 2220205310541002 |
7 | 144130536060650 |
oct | 20266353521572 |
9 | 3873216213662 |
10 | 1124001031034 |
11 | 3a3760308932 |
12 | 161a09807762 |
13 | 81cba37599b |
14 | 3c58acd0dd0 |
15 | 1e387ae77de |
hex | 105b3aea37a |
1124001031034 has 8 divisors (see below), whose sum is σ = 1926858910368. Its totient is φ = 481714727580.
The previous prime is 1124001030967. The next prime is 1124001031037. The reversal of 1124001031034 is 4301301004211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11240010310342 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1124001030997 and 1124001031015.
It is not an unprimeable number, because it can be changed into a prime (1124001031037) 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, 40142893952 + ... + 40142893979.
It is an arithmetic number, because the mean of its divisors is an integer number (240857363796).
Almost surely, 21124001031034 is an apocalyptic number.
1124001031034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1124001031034 is a deficient number, since it is larger than the sum of its proper divisors (802857879334).
1124001031034 is an equidigital number, since it uses as much as digits as its factorization.
1124001031034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80285787940.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1124001031034 its reverse (4301301004211), we get a palindrome (5425302035245).
The spelling of 1124001031034 in words is "one trillion, one hundred twenty-four billion, one million, thirty-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •