Base | Representation |
---|---|
bin | 11001111111010110000001… |
… | …101010011001100110100110 |
3 | 112222201100222001100112101002 |
4 | 121333112001222121212212 |
5 | 104440224334321233410 |
6 | 1043034332542033302 |
7 | 33035126101212662 |
oct | 3177260152314646 |
9 | 488640861315332 |
10 | 114304140024230 |
11 | 3346a128160592 |
12 | 109a0aa9278832 |
13 | 4ba1aac835570 |
14 | 20324c81858a2 |
15 | d334a65607a5 |
hex | 67f581a999a6 |
114304140024230 has 32 divisors (see below), whose sum is σ = 224694942228288. Its totient is φ = 41610174480000.
The previous prime is 114304140024203. The next prime is 114304140024241. The reversal of 114304140024230 is 32420041403411.
114304140024230 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 114304140024193 and 114304140024202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6191981021 + ... + 6191999480.
It is an arithmetic number, because the mean of its divisors is an integer number (7021716944634).
Almost surely, 2114304140024230 is an apocalyptic number.
114304140024230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114304140024230 is a deficient number, since it is larger than the sum of its proper divisors (110390802204058).
114304140024230 is a wasteful number, since it uses less digits than its factorization.
114304140024230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12383980592.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 114304140024230 its reverse (32420041403411), we get a palindrome (146724181427641).
The spelling of 114304140024230 in words is "one hundred fourteen trillion, three hundred four billion, one hundred forty million, twenty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •