Base | Representation |
---|---|
bin | 11001111011000100011111… |
… | …011100010111101011011000 |
3 | 112221200021212012102002002210 |
4 | 121323010133130113223120 |
5 | 104420421332201344112 |
6 | 1042251400455155120 |
7 | 33004660563504036 |
oct | 3173043734275330 |
9 | 487607765362083 |
10 | 114010434403032 |
11 | 3336660aa7a242 |
12 | 10953b9b975aa0 |
13 | 4b801a3a82a6b |
14 | 20221c4da1556 |
15 | d2aa16787b3c |
hex | 67b11f717ad8 |
114010434403032 has 128 divisors (see below), whose sum is σ = 288493828761600. Its totient is φ = 37541917366272.
The previous prime is 114010434403013. The next prime is 114010434403037. The reversal of 114010434403032 is 230304434010411.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114010434403037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13221662673 + ... + 13221671295.
It is an arithmetic number, because the mean of its divisors is an integer number (2253858037200).
Almost surely, 2114010434403032 is an apocalyptic number.
114010434403032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114010434403032 is an abundant number, since it is smaller than the sum of its proper divisors (174483394358568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114010434403032 is a wasteful number, since it uses less digits than its factorization.
114010434403032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13697 (or 13693 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 114010434403032 its reverse (230304434010411), we get a palindrome (344314868413443).
The spelling of 114010434403032 in words is "one hundred fourteen trillion, ten billion, four hundred thirty-four million, four hundred three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •