Base | Representation |
---|---|
bin | 1001100000011100100010… |
… | …0111001101000001101101 |
3 | 1101000022002000110011222011 |
4 | 2120013020213031001231 |
5 | 2332230241403320331 |
6 | 34122015052321221 |
7 | 2126130415526416 |
oct | 230071047150155 |
9 | 41008060404864 |
10 | 10453021151341 |
11 | 3370112a2615a |
12 | 1209a47773211 |
13 | 5aa93c4152a2 |
14 | 281d00d7280d |
15 | 131d915523b1 |
hex | 981c89cd06d |
10453021151341 has 32 divisors (see below), whose sum is σ = 10784279761920. Its totient is φ = 10127991859200.
The previous prime is 10453021151311. The next prime is 10453021151369. The reversal of 10453021151341 is 14315112035401.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10453021151341 - 217 = 10453021020269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10453021151311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2054847300 + ... + 2054852386.
It is an arithmetic number, because the mean of its divisors is an integer number (337008742560).
Almost surely, 210453021151341 is an apocalyptic number.
It is an amenable number.
10453021151341 is a deficient number, since it is larger than the sum of its proper divisors (331258610579).
10453021151341 is a wasteful number, since it uses less digits than its factorization.
10453021151341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6805.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 10453021151341 its reverse (14315112035401), we get a palindrome (24768133186742).
The spelling of 10453021151341 in words is "ten trillion, four hundred fifty-three billion, twenty-one million, one hundred fifty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •