Base | Representation |
---|---|
bin | 11110100100100111110… |
… | …00100111000111010101 |
3 | 10201102101212212000220011 |
4 | 33102103320213013111 |
5 | 114202311444030003 |
6 | 2122323235440221 |
7 | 135615131056600 |
oct | 17222370470725 |
9 | 3642355760804 |
10 | 1050453111253 |
11 | 37554943a157 |
12 | 14b702756071 |
13 | 78098b84420 |
14 | 38bb1005337 |
15 | 1c4d0cb146d |
hex | f493e271d5 |
1050453111253 has 24 divisors (see below), whose sum is σ = 1334486845440. Its totient is φ = 819421676640.
The previous prime is 1050453111251. The next prime is 1050453111277. The reversal of 1050453111253 is 3521113540501.
It is not a de Polignac number, because 1050453111253 - 21 = 1050453111251 is a prime.
It is a super-2 number, since 2×10504531112532 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050453111251) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11567893 + ... + 11658346.
It is an arithmetic number, because the mean of its divisors is an integer number (55603618560).
Almost surely, 21050453111253 is an apocalyptic number.
1050453111253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1050453111253 is a deficient number, since it is larger than the sum of its proper divisors (284033734187).
1050453111253 is a wasteful number, since it uses less digits than its factorization.
1050453111253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23226337 (or 23226330 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 1050453111253 its reverse (3521113540501), we get a palindrome (4571566651754).
The spelling of 1050453111253 in words is "one trillion, fifty billion, four hundred fifty-three million, one hundred eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •