Base | Representation |
---|---|
bin | 11101011010010010001… |
… | …01100110101001100011 |
3 | 10120121101111220202100221 |
4 | 32231021011212221203 |
5 | 113024043120122410 |
6 | 2052123130423511 |
7 | 133003132124305 |
oct | 16551105465143 |
9 | 3517344822327 |
10 | 1010543520355 |
11 | 35a629521886 |
12 | 143a24b91b97 |
13 | 743a8768095 |
14 | 36ca684d975 |
15 | 1b4471d74da |
hex | eb49166a63 |
1010543520355 has 16 divisors (see below), whose sum is σ = 1238614498944. Its totient is φ = 791131110400.
The previous prime is 1010543520341. The next prime is 1010543520361. The reversal of 1010543520355 is 5530253450101.
1010543520355 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1010543520355 - 213 = 1010543512163 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010543520355.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1555455 + ... + 2107255.
It is an arithmetic number, because the mean of its divisors is an integer number (77413406184).
Almost surely, 21010543520355 is an apocalyptic number.
1010543520355 is a deficient number, since it is larger than the sum of its proper divisors (228070978589).
1010543520355 is an equidigital number, since it uses as much as digits as its factorization.
1010543520355 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 559646.
The product of its (nonzero) digits is 45000, while the sum is 34.
Adding to 1010543520355 its reverse (5530253450101), we get a palindrome (6540796970456).
It can be divided in two parts, 101054 and 3520355, that added together give a square (3621409 = 19032).
The spelling of 1010543520355 in words is "one trillion, ten billion, five hundred forty-three million, five hundred twenty thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •