Base | Representation |
---|---|
bin | 11110111111011011110… |
… | …111100001110110100001 |
3 | 21112121010021201111010221 |
4 | 132333123313201312201 |
5 | 234343110040002101 |
6 | 4310211454123041 |
7 | 306602614505551 |
oct | 36773367416641 |
9 | 7477107644127 |
10 | 2129697578401 |
11 | 751221842108 |
12 | 2a48bb4b0481 |
13 | 125aa28a0ac3 |
14 | 75113b15161 |
15 | 3a5e9504aa1 |
hex | 1efdbde1da1 |
2129697578401 has 8 divisors (see below), whose sum is σ = 2223718623360. Its totient is φ = 2035795324992.
The previous prime is 2129697578377. The next prime is 2129697578419. The reversal of 2129697578401 is 1048757969212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2129697578401 is a prime.
It is a super-2 number, since 2×21296975784012 (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 2129697578401.
It is not an unprimeable number, because it can be changed into a prime (2129697578461) 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, 29661240 + ... + 29732953.
It is an arithmetic number, because the mean of its divisors is an integer number (277964827920).
Almost surely, 22129697578401 is an apocalyptic number.
It is an amenable number.
2129697578401 is a deficient number, since it is larger than the sum of its proper divisors (94021044959).
2129697578401 is a wasteful number, since it uses less digits than its factorization.
2129697578401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59395775.
The product of its (nonzero) digits is 15240960, while the sum is 61.
The spelling of 2129697578401 in words is "two trillion, one hundred twenty-nine billion, six hundred ninety-seven million, five hundred seventy-eight thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •