Base | Representation |
---|---|
bin | 11111111000100111010111… |
… | …011110000101000000111001 |
3 | 200101111212010222000121010021 |
4 | 133320213113132011000321 |
5 | 121340012021032432101 |
6 | 1214124435041050441 |
7 | 41352166116023233 |
oct | 3770472736050071 |
9 | 611455128017107 |
10 | 140230002233401 |
11 | 40755234521463 |
12 | 13889620026a21 |
13 | 603282b6c73b2 |
14 | 268b24dc39253 |
15 | 1132a8687b5a1 |
hex | 7f89d7785039 |
140230002233401 has 4 divisors (see below), whose sum is σ = 140230232133712. Its totient is φ = 140229772333092.
The previous prime is 140230002233383. The next prime is 140230002233407. The reversal of 140230002233401 is 104332200032041.
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 140230002233401 - 223 = 140229993844793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140230002233407) 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, 114032775 + ... + 115255948.
It is an arithmetic number, because the mean of its divisors is an integer number (35057558033428).
Almost surely, 2140230002233401 is an apocalyptic number.
It is an amenable number.
140230002233401 is a deficient number, since it is larger than the sum of its proper divisors (229900311).
140230002233401 is an equidigital number, since it uses as much as digits as its factorization.
140230002233401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229900310.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 140230002233401 its reverse (104332200032041), we get a palindrome (244562202265442).
The spelling of 140230002233401 in words is "one hundred forty trillion, two hundred thirty billion, two million, two hundred thirty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •