Base | Representation |
---|---|
bin | 11001111111010101111010… |
… | …100000100011110100000101 |
3 | 112222201100122200111212201010 |
4 | 121333111322200203310011 |
5 | 104440224113110112401 |
6 | 1043034313013352433 |
7 | 33035123113106034 |
oct | 3177257240436405 |
9 | 488640580455633 |
10 | 114304020004101 |
11 | 3346a0764356a4 |
12 | 109a0a75038719 |
13 | 4ba1a90a02435 |
14 | 20324b626271b |
15 | d3349ac53ed6 |
hex | 67f57a823d05 |
114304020004101 has 4 divisors (see below), whose sum is σ = 152405360005472. Its totient is φ = 76202680002732.
The previous prime is 114304020004051. The next prime is 114304020004127. The reversal of 114304020004101 is 101400020403411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 114304020004101 - 218 = 114304019741957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114304020004151) 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, 19050670000681 + ... + 19050670000686.
It is an arithmetic number, because the mean of its divisors is an integer number (38101340001368).
Almost surely, 2114304020004101 is an apocalyptic number.
It is an amenable number.
114304020004101 is a deficient number, since it is larger than the sum of its proper divisors (38101340001371).
114304020004101 is an equidigital number, since it uses as much as digits as its factorization.
114304020004101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38101340001370.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 114304020004101 its reverse (101400020403411), we get a palindrome (215704040407512).
The spelling of 114304020004101 in words is "one hundred fourteen trillion, three hundred four billion, twenty million, four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •