Base | Representation |
---|---|
bin | 1110101110111101101… |
… | …1011100000000111111 |
3 | 220012100201102212101211 |
4 | 3223233123130000333 |
5 | 13121400003103211 |
6 | 312141204145251 |
7 | 24200450266651 |
oct | 3535733340077 |
9 | 805321385354 |
10 | 253125050431 |
11 | 98393545960 |
12 | 41083098227 |
13 | 1ab3c648066 |
14 | c37388a6d1 |
15 | 68b735ee21 |
hex | 3aef6dc03f |
253125050431 has 8 divisors (see below), whose sum is σ = 277321556304. Its totient is φ = 229126067520.
The previous prime is 253125050411. The next prime is 253125050459. The reversal of 253125050431 is 134050521352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 253125050431 - 219 = 253124526143 is a prime.
It is a super-2 number, since 2×2531250504312 (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 = 253125050393 and 253125050402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253125050411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49378056 + ... + 49383181.
It is an arithmetic number, because the mean of its divisors is an integer number (34665194538).
Almost surely, 2253125050431 is an apocalyptic number.
253125050431 is a deficient number, since it is larger than the sum of its proper divisors (24196505873).
253125050431 is a wasteful number, since it uses less digits than its factorization.
253125050431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98761481.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 253125050431 its reverse (134050521352), we get a palindrome (387175571783).
The spelling of 253125050431 in words is "two hundred fifty-three billion, one hundred twenty-five million, fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •