Base | Representation |
---|---|
bin | 1001010100111011000011… |
… | …0000110010000000110111 |
3 | 1100022101002020112101021011 |
4 | 2111032300300302000313 |
5 | 2321004321420411320 |
6 | 33451034525333051 |
7 | 2105621522054530 |
oct | 225166060620067 |
9 | 40271066471234 |
10 | 10255052513335 |
11 | 32a4163882323 |
12 | 11975b8407187 |
13 | 59507cc01376 |
14 | 2764c0991687 |
15 | 12bb565d805a |
hex | 953b0c32037 |
10255052513335 has 32 divisors (see below), whose sum is σ = 14804766466560. Its totient is φ = 6661712792448.
The previous prime is 10255052513281. The next prime is 10255052513341. The reversal of 10255052513335 is 53331525055201.
It is not a de Polignac number, because 10255052513335 - 27 = 10255052513207 is a prime.
It is a super-2 number, since 2×102550525133352 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 21720084 + ... + 22187206.
It is an arithmetic number, because the mean of its divisors is an integer number (462648952080).
Almost surely, 210255052513335 is an apocalyptic number.
10255052513335 is a deficient number, since it is larger than the sum of its proper divisors (4549713953225).
10255052513335 is a wasteful number, since it uses less digits than its factorization.
10255052513335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500167.
The product of its (nonzero) digits is 337500, while the sum is 40.
Adding to 10255052513335 its reverse (53331525055201), we get a palindrome (63586577568536).
The spelling of 10255052513335 in words is "ten trillion, two hundred fifty-five billion, fifty-two million, five hundred thirteen thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •