Base | Representation |
---|---|
bin | 110101010000000010… |
… | …1101101111101001101 |
3 | 101221011121010001200101 |
4 | 1222200011231331031 |
5 | 3333144340100323 |
6 | 124311200331101 |
7 | 11155552326553 |
oct | 1524005557515 |
9 | 357147101611 |
10 | 114355003213 |
11 | 44552466520 |
12 | 1a1b5313a91 |
13 | aa25836b99 |
14 | 576b747bd3 |
15 | 2e945e3dad |
hex | 1aa016df4d |
114355003213 has 4 divisors (see below), whose sum is σ = 124750912608. Its totient is φ = 103959093820.
The previous prime is 114355003193. The next prime is 114355003237. The reversal of 114355003213 is 312300553411.
It is a happy number.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114355003213 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 (114355003313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5197954681 + ... + 5197954702.
It is an arithmetic number, because the mean of its divisors is an integer number (31187728152).
Almost surely, 2114355003213 is an apocalyptic number.
It is an amenable number.
114355003213 is a deficient number, since it is larger than the sum of its proper divisors (10395909395).
114355003213 is a wasteful number, since it uses less digits than its factorization.
114355003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10395909394.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 114355003213 its reverse (312300553411), we get a palindrome (426655556624).
The spelling of 114355003213 in words is "one hundred fourteen billion, three hundred fifty-five million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •