Base | Representation |
---|---|
bin | 1110110100010001111… |
… | …0110111010111010000 |
3 | 220100001011112001000012 |
4 | 3231010132313113100 |
5 | 13132310303342430 |
6 | 312534541014052 |
7 | 24251015255321 |
oct | 3550436672720 |
9 | 810034461005 |
10 | 254552012240 |
11 | 98a55a7a439 |
12 | 41400b54328 |
13 | 1b009176966 |
14 | c46b1ba448 |
15 | 694c77d695 |
hex | 3b447b75d0 |
254552012240 has 20 divisors (see below), whose sum is σ = 591833428644. Its totient is φ = 101820804864.
The previous prime is 254552012237. The next prime is 254552012261. The reversal of 254552012240 is 42210255452.
It can be written as a sum of positive squares in 2 ways, for example, as 70112684944 + 184439327296 = 264788^2 + 429464^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a junction number, because it is equal to n+sod(n) for n = 254552012197 and 254552012206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1590949997 + ... + 1590950156.
Almost surely, 2254552012240 is an apocalyptic number.
254552012240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
254552012240 is an abundant number, since it is smaller than the sum of its proper divisors (337281416404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
254552012240 is a wasteful number, since it uses less digits than its factorization.
254552012240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3181900166 (or 3181900160 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 32.
Adding to 254552012240 its reverse (42210255452), we get a palindrome (296762267692).
The spelling of 254552012240 in words is "two hundred fifty-four billion, five hundred fifty-two million, twelve thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •