Base | Representation |
---|---|
bin | 10011101010100011… |
… | …10011010001100011 |
3 | 1000020202212100211002 |
4 | 21311101303101203 |
5 | 133110212112311 |
6 | 4503340342215 |
7 | 522424366250 |
oct | 116521632143 |
9 | 30222770732 |
10 | 10557535331 |
11 | 45284a9612 |
12 | 206784496b |
13 | cc3368735 |
14 | 722214427 |
15 | 41bcdd93b |
hex | 275473463 |
10557535331 has 4 divisors (see below), whose sum is σ = 12065754672. Its totient is φ = 9049315992.
The previous prime is 10557535321. The next prime is 10557535337. The reversal of 10557535331 is 13353575501.
10557535331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10557535331 - 214 = 10557518947 is a prime.
It is a super-2 number, since 2×105575353312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10557535337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 754109660 + ... + 754109673.
It is an arithmetic number, because the mean of its divisors is an integer number (3016438668).
Almost surely, 210557535331 is an apocalyptic number.
10557535331 is a deficient number, since it is larger than the sum of its proper divisors (1508219341).
10557535331 is an equidigital number, since it uses as much as digits as its factorization.
10557535331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1508219340.
The product of its (nonzero) digits is 118125, while the sum is 38.
The spelling of 10557535331 in words is "ten billion, five hundred fifty-seven million, five hundred thirty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •