Base | Representation |
---|---|
bin | 1001100110001101110100… |
… | …1111100100000001010111 |
3 | 1101100202221120201211222011 |
4 | 2121203131033210001113 |
5 | 2340341301242222130 |
6 | 34235331432245051 |
7 | 2136240103014505 |
oct | 231433517440127 |
9 | 41322846654864 |
10 | 10552151523415 |
11 | 33a9162493997 |
12 | 12250b2240787 |
13 | 5b70a9a03798 |
14 | 286a26701675 |
15 | 13474425e52a |
hex | 998dd3e4057 |
10552151523415 has 16 divisors (see below), whose sum is σ = 13660410146688. Its totient is φ = 7795240900096.
The previous prime is 10552151523307. The next prime is 10552151523509. The reversal of 10552151523415 is 51432515125501.
10552151523415 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10552151523415 - 221 = 10552149426263 is a prime.
It is a super-2 number, since 2×105521515234152 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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, 1171155487 + ... + 1171164496.
It is an arithmetic number, because the mean of its divisors is an integer number (853775634168).
Almost surely, 210552151523415 is an apocalyptic number.
10552151523415 is a deficient number, since it is larger than the sum of its proper divisors (3108258623273).
10552151523415 is a wasteful number, since it uses less digits than its factorization.
10552151523415 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2342320058.
The product of its (nonzero) digits is 150000, while the sum is 40.
Adding to 10552151523415 its reverse (51432515125501), we get a palindrome (61984666648916).
The spelling of 10552151523415 in words is "ten trillion, five hundred fifty-two billion, one hundred fifty-one million, five hundred twenty-three thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •