Base | Representation |
---|---|
bin | 1001100101110101101000… |
… | …0001100001111100101011 |
3 | 1101100011011211111102200210 |
4 | 2121131122001201330223 |
5 | 2340240000143443230 |
6 | 34232335042432203 |
7 | 2135620110011622 |
oct | 231353201417453 |
9 | 41304154442623 |
10 | 10545655062315 |
11 | 33a64293a357a |
12 | 122399a662663 |
13 | 5b65b2b21669 |
14 | 2865ab9bc6b9 |
15 | 1344b3c5beb0 |
hex | 9975a061f2b |
10545655062315 has 32 divisors (see below), whose sum is σ = 17586440441856. Its totient is φ = 5390074846080.
The previous prime is 10545655062311. The next prime is 10545655062421. The reversal of 10545655062315 is 51326055654501.
10545655062315 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 10545655062315 - 22 = 10545655062311 is a prime.
It is a super-2 number, since 2×105456550623152 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10545655062311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 110043504 + ... + 110139293.
It is an arithmetic number, because the mean of its divisors is an integer number (549576263808).
Almost surely, 210545655062315 is an apocalyptic number.
10545655062315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10545655062315 is a deficient number, since it is larger than the sum of its proper divisors (7040785379541).
10545655062315 is a wasteful number, since it uses less digits than its factorization.
10545655062315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220182939.
The product of its (nonzero) digits is 2700000, while the sum is 48.
The spelling of 10545655062315 in words is "ten trillion, five hundred forty-five billion, six hundred fifty-five million, sixty-two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •