Base | Representation |
---|---|
bin | 1110110000111000101… |
… | …1101011011100010011 |
3 | 220020200200022111000000 |
4 | 3230032023223130103 |
5 | 13123424044404021 |
6 | 312304315101043 |
7 | 24216314016021 |
oct | 3541613533423 |
9 | 806620274000 |
10 | 253641013011 |
11 | 98628815211 |
12 | 411a7a41783 |
13 | 1abc24cb969 |
14 | c3c21d9711 |
15 | 68e77ccb26 |
hex | 3b0e2eb713 |
253641013011 has 56 divisors (see below), whose sum is σ = 390280692816. Its totient is φ = 164665820160.
The previous prime is 253641013007. The next prime is 253641013049. The reversal of 253641013011 is 110310146352.
It is a happy number.
253641013011 is a `hidden beast` number, since 2 + 5 + 3 + 641 + 0 + 1 + 3 + 0 + 11 = 666.
It is not a de Polignac number, because 253641013011 - 22 = 253641013007 is a prime.
It is a super-2 number, since 2×2536410130112 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (253641013001) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 16819971 + ... + 16835043.
It is an arithmetic number, because the mean of its divisors is an integer number (6969298086).
Almost surely, 2253641013011 is an apocalyptic number.
253641013011 is a deficient number, since it is larger than the sum of its proper divisors (136639679805).
253641013011 is an equidigital number, since it uses as much as digits as its factorization.
253641013011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15695 (or 15680 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 253641013011 its reverse (110310146352), we get a palindrome (363951159363).
The spelling of 253641013011 in words is "two hundred fifty-three billion, six hundred forty-one million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •