Base | Representation |
---|---|
bin | 10100010010101110000… |
… | …110010110111110010011 |
3 | 11221022102102112100210211 |
4 | 110102232012112332103 |
5 | 140321404004301301 |
6 | 2544341530504551 |
7 | 202514525013364 |
oct | 24225606267623 |
9 | 4838372470724 |
10 | 1394490306451 |
11 | 498444472a50 |
12 | 1a6317b95157 |
13 | a16662aac88 |
14 | 4b6ca98bb6b |
15 | 264195c8051 |
hex | 144ae196f93 |
1394490306451 has 8 divisors (see below), whose sum is σ = 1521603525744. Its totient is φ = 1267433982720.
The previous prime is 1394490306427. The next prime is 1394490306493. The reversal of 1394490306451 is 1546030944931.
It is a happy number.
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 1394490306451 - 27 = 1394490306323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1394490306395 and 1394490306404.
It is not an unprimeable number, because it can be changed into a prime (1394490306551) 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, 14172630 + ... + 14270683.
It is an arithmetic number, because the mean of its divisors is an integer number (190200440718).
Almost surely, 21394490306451 is an apocalyptic number.
1394490306451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1394490306451 is a deficient number, since it is larger than the sum of its proper divisors (127113219293).
1394490306451 is a wasteful number, since it uses less digits than its factorization.
1394490306451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28447781.
The product of its (nonzero) digits is 1399680, while the sum is 49.
The spelling of 1394490306451 in words is "one trillion, three hundred ninety-four billion, four hundred ninety million, three hundred six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •