Base | Representation |
---|---|
bin | 1110100100100110010… |
… | …0101011001111010111 |
3 | 212221011210111100000022 |
4 | 3221021210223033113 |
5 | 13100200132013411 |
6 | 311001123335355 |
7 | 24041501515412 |
oct | 3511144531727 |
9 | 787153440008 |
10 | 250342454231 |
11 | 97195875181 |
12 | 4062722155b |
13 | 1a7b800262c |
14 | c18c0b6b79 |
15 | 67a2e11edb |
hex | 3a4992b3d7 |
250342454231 has 6 divisors (see below), whose sum is σ = 252268070496. Its totient is φ = 248431426100.
The previous prime is 250342454203. The next prime is 250342454251. The reversal of 250342454231 is 132454243052.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-250342454231 is a prime.
It is a super-2 number, since 2×2503424542312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 250342454191 and 250342454200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250342454251) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7276775 + ... + 7311096.
It is an arithmetic number, because the mean of its divisors is an integer number (42044678416).
Almost surely, 2250342454231 is an apocalyptic number.
250342454231 is a deficient number, since it is larger than the sum of its proper divisors (1925616265).
250342454231 is an equidigital number, since it uses as much as digits as its factorization.
250342454231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14588133 (or 14588002 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 250342454231 its reverse (132454243052), we get a palindrome (382796697283).
The spelling of 250342454231 in words is "two hundred fifty billion, three hundred forty-two million, four hundred fifty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •