Base | Representation |
---|---|
bin | 1110110001000000111… |
… | …1000010111110100011 |
3 | 220020210002010002001020 |
4 | 3230100033002332203 |
5 | 13124011403402100 |
6 | 312311545140523 |
7 | 24220212515142 |
oct | 3542017027643 |
9 | 806702102036 |
10 | 253675450275 |
11 | 986461a6465 |
12 | 411b748a743 |
13 | 1abc9698540 |
14 | c3c6a01759 |
15 | 68ea8315a0 |
hex | 3b103c2fa3 |
253675450275 has 24 divisors (see below), whose sum is σ = 451672393200. Its totient is φ = 124886375040.
The previous prime is 253675450267. The next prime is 253675450297. The reversal of 253675450275 is 572054576352.
253675450275 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 253675450275 - 23 = 253675450267 is a prime.
It is a super-3 number, since 3×2536754502753 (a number of 35 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 130089000 + ... + 130090949.
It is an arithmetic number, because the mean of its divisors is an integer number (18819683050).
Almost surely, 2253675450275 is an apocalyptic number.
253675450275 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
253675450275 is a deficient number, since it is larger than the sum of its proper divisors (197996942925).
253675450275 is a wasteful number, since it uses less digits than its factorization.
253675450275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260179975 (or 260179970 counting only the distinct ones).
The product of its (nonzero) digits is 8820000, while the sum is 51.
The spelling of 253675450275 in words is "two hundred fifty-three billion, six hundred seventy-five million, four hundred fifty thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •