Base | Representation |
---|---|
bin | 111010011010010111000… |
… | …101011001101110111001 |
3 | 112012201220221120110111220 |
4 | 322122113011121232321 |
5 | 1011231220230331301 |
6 | 12312004420142253 |
7 | 563001336666132 |
oct | 72322705315671 |
9 | 15181827513456 |
10 | 4014034230201 |
11 | 130838474a526 |
12 | 549b43b37989 |
13 | 2316a2530b68 |
14 | dc3cd1a6c89 |
15 | 6e633100936 |
hex | 3a697159bb9 |
4014034230201 has 4 divisors (see below), whose sum is σ = 5352045640272. Its totient is φ = 2676022820132.
The previous prime is 4014034230191. The next prime is 4014034230203. The reversal of 4014034230201 is 1020324304104.
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 not a de Polignac number, because 4014034230201 - 25 = 4014034230169 is a prime.
It is a super-2 number, since 2×40140342302012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4014034230203) 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, 669005705031 + ... + 669005705036.
It is an arithmetic number, because the mean of its divisors is an integer number (1338011410068).
Almost surely, 24014034230201 is an apocalyptic number.
It is an amenable number.
4014034230201 is a deficient number, since it is larger than the sum of its proper divisors (1338011410071).
4014034230201 is a wasteful number, since it uses less digits than its factorization.
4014034230201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1338011410070.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 4014034230201 its reverse (1020324304104), we get a palindrome (5034358534305).
The spelling of 4014034230201 in words is "four trillion, fourteen billion, thirty-four million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •