Base | Representation |
---|---|
bin | 10000010110010001110… |
… | …100110110010010100010 |
3 | 10222101202222102020110020 |
4 | 100112101310312102202 |
5 | 121401242322430214 |
6 | 2220033100214310 |
7 | 144110501030613 |
oct | 20262164662242 |
9 | 3871688366406 |
10 | 1123433014434 |
11 | 3a3499715625 |
12 | 16188b53a396 |
13 | 81c29797aa3 |
14 | 3c5356b1c0a |
15 | 1e352ce64a9 |
hex | 10591d364a2 |
1123433014434 has 8 divisors (see below), whose sum is σ = 2246866028880. Its totient is φ = 374477671476.
The previous prime is 1123433014411. The next prime is 1123433014531. The reversal of 1123433014434 is 4344103343211.
It is a sphenic number, since it is the product of 3 distinct primes.
1123433014434 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1123433014395 and 1123433014404.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 93619417864 + ... + 93619417875.
It is an arithmetic number, because the mean of its divisors is an integer number (280858253610).
Almost surely, 21123433014434 is an apocalyptic number.
1123433014434 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123433014434 is a wasteful number, since it uses less digits than its factorization.
1123433014434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187238835744.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 1123433014434 its reverse (4344103343211), we get a palindrome (5467536357645).
The spelling of 1123433014434 in words is "one trillion, one hundred twenty-three billion, four hundred thirty-three million, fourteen thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •