Base | Representation |
---|---|
bin | 10100011101101000011… |
… | …011110100110110110001 |
3 | 11222102122221111010202101 |
4 | 110131220123310312301 |
5 | 141014402321240031 |
6 | 2554000300020401 |
7 | 203411051305015 |
oct | 24355033646661 |
9 | 4872587433671 |
10 | 1406206430641 |
11 | 4a2406963511 |
12 | 1a8647831701 |
13 | a27b269bc3c |
14 | 4c0bc9d2545 |
15 | 268a2e72361 |
hex | 147686f4db1 |
1406206430641 has 8 divisors (see below), whose sum is σ = 1430356880160. Its totient is φ = 1382066529312.
The previous prime is 1406206430623. The next prime is 1406206430677. The reversal of 1406206430641 is 1460346026041.
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 1406206430641 - 27 = 1406206430513 is a prime.
It is a super-2 number, since 2×14062064306412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1406206430641.
It is not an unprimeable number, because it can be changed into a prime (1406206460641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2367900 + ... + 2901613.
It is an arithmetic number, because the mean of its divisors is an integer number (178794610020).
Almost surely, 21406206430641 is an apocalyptic number.
It is an amenable number.
1406206430641 is a deficient number, since it is larger than the sum of its proper divisors (24150449519).
1406206430641 is an equidigital number, since it uses as much as digits as its factorization.
1406206430641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5274095.
The product of its (nonzero) digits is 82944, while the sum is 37.
The spelling of 1406206430641 in words is "one trillion, four hundred six billion, two hundred six million, four hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •