Base | Representation |
---|---|
bin | 1000001011000010010… |
… | …0001100001001100001 |
3 | 111102101210200111102121 |
4 | 2002300210030021201 |
5 | 4300020203333213 |
6 | 144255513344241 |
7 | 13100162524222 |
oct | 2026044141141 |
9 | 442353614377 |
10 | 140401230433 |
11 | 545a891a542 |
12 | 23264108081 |
13 | 10316a44659 |
14 | 6b1ca33249 |
15 | 39bb07988d |
hex | 20b090c261 |
140401230433 has 4 divisors (see below), whose sum is σ = 140988683520. Its totient is φ = 139813777348.
The previous prime is 140401230377. The next prime is 140401230469. The reversal of 140401230433 is 334032104041.
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 a de Polignac number, because none of the positive numbers 2k-140401230433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140401230398 and 140401230407.
It is not an unprimeable number, because it can be changed into a prime (140401230133) 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, 293726185 + ... + 293726662.
It is an arithmetic number, because the mean of its divisors is an integer number (35247170880).
Almost surely, 2140401230433 is an apocalyptic number.
It is an amenable number.
140401230433 is a deficient number, since it is larger than the sum of its proper divisors (587453087).
140401230433 is an equidigital number, since it uses as much as digits as its factorization.
140401230433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 587453086.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 140401230433 its reverse (334032104041), we get a palindrome (474433334474).
The spelling of 140401230433 in words is "one hundred forty billion, four hundred one million, two hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •