Base | Representation |
---|---|
bin | 10010100000011100110011… |
… | …11101100110001000000001 |
3 | 12100002122002122122210112001 |
4 | 21100032121331212020001 |
5 | 20313241232414044333 |
6 | 222320043203504001 |
7 | 11400201315622054 |
oct | 1120163175461001 |
9 | 170078078583461 |
10 | 40697398190593 |
11 | 11a70740332861 |
12 | 4693518388001 |
13 | 19929959a9cc1 |
14 | a09a9c02aa9b |
15 | 4a8975687b7d |
hex | 250399f66201 |
40697398190593 has 16 divisors (see below), whose sum is σ = 40948838053200. Its totient is φ = 40446947229696.
The previous prime is 40697398190569. The next prime is 40697398190609. The reversal of 40697398190593 is 39509189379604.
It can be written as a sum of positive squares in 8 ways, for example, as 6105979376784 + 34591418813809 = 2471028^2 + 5881447^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40697398190593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40697398190563) 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 15 ways as a sum of consecutive naturals, for example, 133326721 + ... + 133631617.
It is an arithmetic number, because the mean of its divisors is an integer number (2559302378325).
Almost surely, 240697398190593 is an apocalyptic number.
It is an amenable number.
40697398190593 is a deficient number, since it is larger than the sum of its proper divisors (251439862607).
40697398190593 is a wasteful number, since it uses less digits than its factorization.
40697398190593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306516.
The product of its (nonzero) digits is 396809280, while the sum is 73.
The spelling of 40697398190593 in words is "forty trillion, six hundred ninety-seven billion, three hundred ninety-eight million, one hundred ninety thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •