Base | Representation |
---|---|
bin | 11010000100111011… |
… | …11010100101101101 |
3 | 1100010200112201212011 |
4 | 31002131322211231 |
5 | 212133002242201 |
6 | 10233113241221 |
7 | 1003635244012 |
oct | 150235724555 |
9 | 40120481764 |
10 | 14000040301 |
11 | 5a34726545 |
12 | 2868703211 |
13 | 1421624320 |
14 | 96b4c7709 |
15 | 56e140151 |
hex | 34277a96d |
14000040301 has 8 divisors (see below), whose sum is σ = 15080038400. Its totient is φ = 12920481072.
The previous prime is 14000040287. The next prime is 14000040323. The reversal of 14000040301 is 10304000041.
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 14000040301 - 217 = 13999909229 is a prime.
It is a super-2 number, since 2×140000403012 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14000080301) 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 7 ways as a sum of consecutive naturals, for example, 41901 + ... + 172498.
It is an arithmetic number, because the mean of its divisors is an integer number (1885004800).
Almost surely, 214000040301 is an apocalyptic number.
It is an amenable number.
14000040301 is a deficient number, since it is larger than the sum of its proper divisors (1079998099).
14000040301 is a wasteful number, since it uses less digits than its factorization.
14000040301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219435.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 14000040301 its reverse (10304000041), we get a palindrome (24304040342).
The spelling of 14000040301 in words is "fourteen billion, forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •