Base | Representation |
---|---|
bin | 110101000110101010… |
… | …0110101111100101001 |
3 | 101220100122202110020012 |
4 | 1222031110311330221 |
5 | 3332023242413001 |
6 | 124220033141305 |
7 | 11145010500056 |
oct | 1521524657451 |
9 | 356318673205 |
10 | 114040201001 |
11 | 444007a1a01 |
12 | 1a1279ba835 |
13 | a9a555579c |
14 | 573ba0002d |
15 | 2e76b5e2bb |
hex | 1a8d535f29 |
114040201001 has 4 divisors (see below), whose sum is σ = 115169312004. Its totient is φ = 112911090000.
The previous prime is 114040200983. The next prime is 114040201013. The reversal of 114040201001 is 100102040411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 96147125776 + 17893075225 = 310076^2 + 133765^2 .
It is a cyclic number.
It is not a de Polignac number, because 114040201001 - 214 = 114040184617 is a prime.
It is a super-4 number, since 4×1140402010014 (a number of 45 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114040201031) 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, 564555350 + ... + 564555551.
It is an arithmetic number, because the mean of its divisors is an integer number (28792328001).
Almost surely, 2114040201001 is an apocalyptic number.
It is an amenable number.
114040201001 is a deficient number, since it is larger than the sum of its proper divisors (1129111003).
114040201001 is a wasteful number, since it uses less digits than its factorization.
114040201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1129111002.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 114040201001 its reverse (100102040411), we get a palindrome (214142241412).
The spelling of 114040201001 in words is "one hundred fourteen billion, forty million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •