Base | Representation |
---|---|
bin | 11001111011001110010111… |
… | …110001110000110010101000 |
3 | 112221201022020112202101100102 |
4 | 121323032113301300302220 |
5 | 104421110044030231212 |
6 | 1042300313310524532 |
7 | 33005514513052430 |
oct | 3173162761606250 |
9 | 487638215671312 |
10 | 114021043211432 |
11 | 33370064408a95 |
12 | 10956060806748 |
13 | 4b811a4931196 |
14 | 202290dd212c0 |
15 | d2ae37d035c2 |
hex | 67b397c70ca8 |
114021043211432 has 32 divisors (see below), whose sum is σ = 247977535350720. Its totient is φ = 48136815682560.
The previous prime is 114021043211377. The next prime is 114021043211461. The reversal of 114021043211432 is 234112340120411.
It is a super-4 number, since 4×1140210432114324 (a number of 57 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114021043211395 and 114021043211404.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15194698169 + ... + 15194705672.
It is an arithmetic number, because the mean of its divisors is an integer number (7749297979710).
Almost surely, 2114021043211432 is an apocalyptic number.
It is an amenable number.
114021043211432 is an abundant number, since it is smaller than the sum of its proper divisors (133956492139288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114021043211432 is a wasteful number, since it uses less digits than its factorization.
114021043211432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30389403921 (or 30389403917 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 114021043211432 its reverse (234112340120411), we get a palindrome (348133383331843).
The spelling of 114021043211432 in words is "one hundred fourteen trillion, twenty-one billion, forty-three million, two hundred eleven thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •