Base | Representation |
---|---|
bin | 11111111000011000100101… |
… | …011011111000110111001001 |
3 | 200101110100011211101120200021 |
4 | 133320120211123320313021 |
5 | 121334232014341204001 |
6 | 1214113252100540441 |
7 | 41351064601542331 |
oct | 3770304533706711 |
9 | 611410154346607 |
10 | 140214130413001 |
11 | 4074952a274917 |
12 | 138865306b1721 |
13 | 603119c3701a8 |
14 | 268a585d120c1 |
15 | 1132458254ba1 |
hex | 7f86256f8dc9 |
140214130413001 has 4 divisors (see below), whose sum is σ = 140214615887104. Its totient is φ = 140213644938900.
The previous prime is 140214130412977. The next prime is 140214130413013. The reversal of 140214130413001 is 100314031412041.
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 a cyclic number.
It is not a de Polignac number, because 140214130413001 - 231 = 140211982929353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140214130413601) 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, 242303565 + ... + 242881546.
It is an arithmetic number, because the mean of its divisors is an integer number (35053653971776).
Almost surely, 2140214130413001 is an apocalyptic number.
It is an amenable number.
140214130413001 is a deficient number, since it is larger than the sum of its proper divisors (485474103).
140214130413001 is an equidigital number, since it uses as much as digits as its factorization.
140214130413001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485474102.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 140214130413001 its reverse (100314031412041), we get a palindrome (240528161825042).
The spelling of 140214130413001 in words is "one hundred forty trillion, two hundred fourteen billion, one hundred thirty million, four hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •