Base | Representation |
---|---|
bin | 10010010000110011110… |
… | …110110011000001011101 |
3 | 11102222101010202121212011 |
4 | 102100303312303001131 |
5 | 131030220104000323 |
6 | 2400312251111221 |
7 | 156446036561413 |
oct | 22206366630135 |
9 | 4388333677764 |
10 | 1255000453213 |
11 | 444274046701 |
12 | 183289142511 |
13 | 91466314690 |
14 | 44a56dd72b3 |
15 | 229a357620d |
hex | 12433db305d |
1255000453213 has 32 divisors (see below), whose sum is σ = 1415125958400. Its totient is φ = 1104993985536.
The previous prime is 1255000453199. The next prime is 1255000453297. The reversal of 1255000453213 is 3123540005521.
It is a cyclic number.
It is not a de Polignac number, because 1255000453213 - 221 = 1254998356061 is a prime.
It is a super-2 number, since 2×12550004532132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1255000453013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13030528 + ... + 13126486.
It is an arithmetic number, because the mean of its divisors is an integer number (44222686200).
Almost surely, 21255000453213 is an apocalyptic number.
1255000453213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1255000453213 is a deficient number, since it is larger than the sum of its proper divisors (160125505187).
1255000453213 is a wasteful number, since it uses less digits than its factorization.
1255000453213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96421.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 1255000453213 its reverse (3123540005521), we get a palindrome (4378540458734).
The spelling of 1255000453213 in words is "one trillion, two hundred fifty-five billion, four hundred fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •