Base | Representation |
---|---|
bin | 10010010001001100100… |
… | …010011100111000100100 |
3 | 11110000102222221220221010 |
4 | 102101030202130320210 |
5 | 131032042111100202 |
6 | 2400421322422220 |
7 | 156462225415005 |
oct | 22211442347044 |
9 | 4400388856833 |
10 | 1255414550052 |
11 | 44446686a7a3 |
12 | 183383961970 |
13 | 915010504b0 |
14 | 44a95dcb1ac |
15 | 229c9ac176c |
hex | 1244c89ce24 |
1255414550052 has 24 divisors (see below), whose sum is σ = 3154631433856. Its totient is φ = 386281399968.
The previous prime is 1255414550023. The next prime is 1255414550059. The reversal of 1255414550052 is 2500554145521.
It is a happy number.
It is a super-2 number, since 2×12554145500522 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (1255414550059) 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, 4023764428 + ... + 4023764739.
Almost surely, 21255414550052 is an apocalyptic number.
1255414550052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1255414550052 is an abundant number, since it is smaller than the sum of its proper divisors (1899216883804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1255414550052 is a wasteful number, since it uses less digits than its factorization.
1255414550052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8047529187 (or 8047529185 counting only the distinct ones).
The product of its (nonzero) digits is 200000, while the sum is 39.
Adding to 1255414550052 its reverse (2500554145521), we get a palindrome (3755968695573).
The spelling of 1255414550052 in words is "one trillion, two hundred fifty-five billion, four hundred fourteen million, five hundred fifty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •