Base | Representation |
---|---|
bin | 1000001010101111001… |
… | …0010001000000111101 |
3 | 111102012012210010000111 |
4 | 2002223302101000331 |
5 | 4244334141044201 |
6 | 144243530430021 |
7 | 13065200053240 |
oct | 2025362210075 |
9 | 442165703014 |
10 | 140321034301 |
11 | 54567624a48 |
12 | 23241292311 |
13 | 10303245c16 |
14 | 6b12119257 |
15 | 39b3ed7b51 |
hex | 20abc9103d |
140321034301 has 4 divisors (see below), whose sum is σ = 160366896352. Its totient is φ = 120275172252.
The previous prime is 140321034299. The next prime is 140321034307. The reversal of 140321034301 is 103430123041.
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, and also an emirpimes, since its reverse is a distinct semiprime: 103430123041 = 7 ⋅14775731863.
It is a cyclic number.
It is not a de Polignac number, because 140321034301 - 21 = 140321034299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140321034307) 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, 10022931015 + ... + 10022931028.
It is an arithmetic number, because the mean of its divisors is an integer number (40091724088).
Almost surely, 2140321034301 is an apocalyptic number.
It is an amenable number.
140321034301 is a deficient number, since it is larger than the sum of its proper divisors (20045862051).
140321034301 is an equidigital number, since it uses as much as digits as its factorization.
140321034301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20045862050.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 140321034301 its reverse (103430123041), we get a palindrome (243751157342).
The spelling of 140321034301 in words is "one hundred forty billion, three hundred twenty-one million, thirty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •