Base | Representation |
---|---|
bin | 11111110101110001000011… |
… | …010001100101000001000001 |
3 | 200100211010212010100201011010 |
4 | 133311301003101211001001 |
5 | 121323310112023302241 |
6 | 1213454502020311133 |
7 | 41332066032632013 |
oct | 3765610321450101 |
9 | 610733763321133 |
10 | 140034242400321 |
11 | 4068a209171445 |
12 | 138576a85424a9 |
13 | 601a2319a8739 |
14 | 268199cd481b3 |
15 | 112c92a7bcd16 |
hex | 7f5c43465041 |
140034242400321 has 4 divisors (see below), whose sum is σ = 186712323200432. Its totient is φ = 93356161600212.
The previous prime is 140034242400307. The next prime is 140034242400323. The reversal of 140034242400321 is 123004242430041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 140034242400321 - 25 = 140034242400289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140034242400323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23339040400051 + ... + 23339040400056.
It is an arithmetic number, because the mean of its divisors is an integer number (46678080800108).
Almost surely, 2140034242400321 is an apocalyptic number.
It is an amenable number.
140034242400321 is a deficient number, since it is larger than the sum of its proper divisors (46678080800111).
140034242400321 is an equidigital number, since it uses as much as digits as its factorization.
140034242400321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46678080800110.
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 140034242400321 its reverse (123004242430041), we get a palindrome (263038484830362).
The spelling of 140034242400321 in words is "one hundred forty trillion, thirty-four billion, two hundred forty-two million, four hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •