Base | Representation |
---|---|
bin | 10110101111011110111000… |
… | …101100001000110011111010 |
3 | 111010010211002220121102012001 |
4 | 112233132320230020303322 |
5 | 101102211431003000442 |
6 | 552420315443011214 |
7 | 30032130614266351 |
oct | 2657367054106372 |
9 | 433124086542161 |
10 | 100020002000122 |
11 | 29962276681996 |
12 | b274668369b0a |
13 | 43a6acc071089 |
14 | 1a9adcb498998 |
15 | b86b3a7d32b7 |
hex | 5af7b8b08cfa |
100020002000122 has 4 divisors (see below), whose sum is σ = 150030003000186. Its totient is φ = 50010001000060.
The previous prime is 100020002000101. The next prime is 100020002000129. The reversal of 100020002000122 is 221000200020001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 55614291335001 + 44405710665121 = 7457499^2 + 6663761^2 .
It is a junction number, because it is equal to n+sod(n) for n = 100020002000099 and 100020002000108.
It is not an unprimeable number, because it can be changed into a prime (100020002000129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25005000500029 + ... + 25005000500032.
Almost surely, 2100020002000122 is an apocalyptic number.
100020002000122 is a deficient number, since it is larger than the sum of its proper divisors (50010001000064).
100020002000122 is an equidigital number, since it uses as much as digits as its factorization.
100020002000122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50010001000063.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 100020002000122 its reverse (221000200020001), we get a palindrome (321020202020123).
It can be divided in two parts, 1000200020001 and 22, that multiplied together give a palindrome (22004400440022).
The spelling of 100020002000122 in words is "one hundred trillion, twenty billion, two million, one hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •