Base | Representation |
---|---|
bin | 11010001011101001… |
… | …11010110001010001 |
3 | 1100021121121012120112 |
4 | 31011310322301101 |
5 | 212241414331001 |
6 | 10242445251105 |
7 | 1005221305565 |
oct | 150564726121 |
9 | 40247535515 |
10 | 14056402001 |
11 | 5a63521964 |
12 | 2883563a95 |
13 | 14301c9245 |
14 | 974b996a5 |
15 | 574074cbb |
hex | 345d3ac51 |
14056402001 has 8 divisors (see below), whose sum is σ = 14489642880. Its totient is φ = 13628751568.
The previous prime is 14056401937. The next prime is 14056402079. The reversal of 14056402001 is 10020465041.
14056402001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14056402001 - 26 = 14056401937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14056404001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1392506 + ... + 1402563.
It is an arithmetic number, because the mean of its divisors is an integer number (1811205360).
Almost surely, 214056402001 is an apocalyptic number.
It is an amenable number.
14056402001 is a deficient number, since it is larger than the sum of its proper divisors (433240879).
14056402001 is a wasteful number, since it uses less digits than its factorization.
14056402001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2795223.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 14056402001 its reverse (10020465041), we get a palindrome (24076867042).
The spelling of 14056402001 in words is "fourteen billion, fifty-six million, four hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •