Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …010100111001010000001 |
3 | 21002012100102212220221100 |
4 | 131012221102213022001 |
5 | 230232000001133441 |
6 | 4130442021245013 |
7 | 264331602453444 |
oct | 35065122471201 |
9 | 7065312786840 |
10 | 2000000021121 |
11 | 701216965743 |
12 | 283743b63769 |
13 | 1167a3570b7b |
14 | 6cb2c89765b |
15 | 37057ed3cb6 |
hex | 1d1a94a7281 |
2000000021121 has 6 divisors (see below), whose sum is σ = 2888888919410. Its totient is φ = 1333333347408.
The previous prime is 2000000021113. The next prime is 2000000021147. The reversal of 2000000021121 is 1211200000002.
It can be written as a sum of positive squares in only one way, i.e., 1987803911025 + 12196110096 = 1409895^2 + 110436^2 .
It is not a de Polignac number, because 2000000021121 - 23 = 2000000021113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 222222224569 = 2000000021121 / (2 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 2 + 1 + 1 + 2 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2000000021521) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 111111112276 + ... + 111111112293.
Almost surely, 22000000021121 is an apocalyptic number.
It is an amenable number.
2000000021121 is a deficient number, since it is larger than the sum of its proper divisors (888888898289).
2000000021121 is a wasteful number, since it uses less digits than its factorization.
2000000021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222222224575 (or 222222224572 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2000000021121 its reverse (1211200000002), we get a palindrome (3211200021123).
The spelling of 2000000021121 in words is "two trillion, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •