Base | Representation |
---|---|
bin | 1001100110011000011101… |
… | …1000101110001100100111 |
3 | 1101101001022112000212211011 |
4 | 2121212013120232030213 |
5 | 2340413123022113421 |
6 | 34240523002523051 |
7 | 2136400614055624 |
oct | 231460730561447 |
9 | 41331275025734 |
10 | 10555006051111 |
11 | 33aa397824895 |
12 | 122576a206487 |
13 | 5b7443212c22 |
14 | 286c1787b34b |
15 | 13485eb6a4e1 |
hex | 9998762e327 |
10555006051111 has 8 divisors (see below), whose sum is σ = 11134633633200. Its totient is φ = 9977788563840.
The previous prime is 10555006051067. The next prime is 10555006051159. The reversal of 10555006051111 is 11115060055501.
10555006051111 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 a cyclic number.
It is not a de Polignac number, because 10555006051111 - 227 = 10554871833383 is a prime.
It is a super-2 number, since 2×105550060511112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10555006031111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 602514706 + ... + 602532223.
It is an arithmetic number, because the mean of its divisors is an integer number (1391829204150).
Almost surely, 210555006051111 is an apocalyptic number.
10555006051111 is a deficient number, since it is larger than the sum of its proper divisors (579627582089).
10555006051111 is a wasteful number, since it uses less digits than its factorization.
10555006051111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1205047409.
The product of its (nonzero) digits is 3750, while the sum is 31.
The spelling of 10555006051111 in words is "ten trillion, five hundred fifty-five billion, six million, fifty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.511 sec. • engine limits •