Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …11000000010011011001 |
3 | 10120120000102021122011111 |
4 | 32230221113000103121 |
5 | 113022000332222334 |
6 | 2051554233300321 |
7 | 132654006433015 |
oct | 16545127002331 |
9 | 3516012248144 |
10 | 1010011210969 |
11 | 35a385aa7972 |
12 | 1438b68646a1 |
13 | 743223acb07 |
14 | 36c55c87545 |
15 | 1b4155db064 |
hex | eb295c04d9 |
1010011210969 has 2 divisors, whose sum is σ = 1010011210970. Its totient is φ = 1010011210968.
The previous prime is 1010011210927. The next prime is 1010011210973. The reversal of 1010011210969 is 9690121100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 703228156569 + 306783054400 = 838587^2 + 553880^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010011210969 - 225 = 1009977656537 is a prime.
It is a super-2 number, since 2×10100112109692 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1010011210969.
It is not a weakly prime, because it can be changed into another prime (1010011010969) by changing a digit.
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 as a sum of consecutive naturals, namely, 505005605484 + 505005605485.
It is an arithmetic number, because the mean of its divisors is an integer number (505005605485).
Almost surely, 21010011210969 is an apocalyptic number.
It is an amenable number.
1010011210969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010011210969 is an equidigital number, since it uses as much as digits as its factorization.
1010011210969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 31.
The spelling of 1010011210969 in words is "one trillion, ten billion, eleven million, two hundred ten thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •