Base | Representation |
---|---|
bin | 1001001001000111100101… |
… | …1010101100011010011011 |
3 | 1022120222122022121101221001 |
4 | 2102101321122230122123 |
5 | 2304144012142412220 |
6 | 33213540021125431 |
7 | 2055152246362240 |
oct | 222217132543233 |
9 | 38528568541831 |
10 | 10052260513435 |
11 | 3226159aa8298 |
12 | 1164241859877 |
13 | 57bc0232645a |
14 | 26a763b6d5c7 |
15 | 126737ea980a |
hex | 924796ac69b |
10052260513435 has 8 divisors (see below), whose sum is σ = 13785957275616. Its totient is φ = 6892978637760.
The previous prime is 10052260513319. The next prime is 10052260513441. The reversal of 10052260513435 is 53431506225001.
10052260513435 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10052260513435 - 27 = 10052260513307 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10052260513394 and 10052260513403.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143603721586 + ... + 143603721655.
It is an arithmetic number, because the mean of its divisors is an integer number (1723244659452).
Almost surely, 210052260513435 is an apocalyptic number.
10052260513435 is a deficient number, since it is larger than the sum of its proper divisors (3733696762181).
10052260513435 is an equidigital number, since it uses as much as digits as its factorization.
10052260513435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 287207443253.
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 10052260513435 its reverse (53431506225001), we get a palindrome (63483766738436).
The spelling of 10052260513435 in words is "ten trillion, fifty-two billion, two hundred sixty million, five hundred thirteen thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •