Base | Representation |
---|---|
bin | 1011101000000101111101… |
… | …0001011110111001001001 |
3 | 1200021002020121002000200021 |
4 | 2322001133101132321021 |
5 | 3133420421244411101 |
6 | 43104342250540441 |
7 | 2456400043301032 |
oct | 272013721367111 |
9 | 50232217060607 |
10 | 12783421091401 |
11 | 4089466a41144 |
12 | 1525619a37721 |
13 | 71961899056c |
14 | 322a14159a89 |
15 | 1727d59b85a1 |
hex | ba05f45ee49 |
12783421091401 has 8 divisors (see below), whose sum is σ = 13563180449280. Its totient is φ = 12006749890368.
The previous prime is 12783421091351. The next prime is 12783421091453. The reversal of 12783421091401 is 10419012438721.
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 12783421091401 - 29 = 12783421090889 is a prime.
It is a super-2 number, since 2×127834210914012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12783421091471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 772030681 + ... + 772047238.
It is an arithmetic number, because the mean of its divisors is an integer number (1695397556160).
Almost surely, 212783421091401 is an apocalyptic number.
It is an amenable number.
12783421091401 is a deficient number, since it is larger than the sum of its proper divisors (779759357879).
12783421091401 is a wasteful number, since it uses less digits than its factorization.
12783421091401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544078423.
The product of its (nonzero) digits is 96768, while the sum is 43.
The spelling of 12783421091401 in words is "twelve trillion, seven hundred eighty-three billion, four hundred twenty-one million, ninety-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •