Base | Representation |
---|---|
bin | 10110101111011110111000… |
… | …100101010011110100101111 |
3 | 111010010211002210020110220111 |
4 | 112233132320211103310233 |
5 | 101102211430023211343 |
6 | 552420315340400451 |
7 | 30032130563133112 |
oct | 2657367045236457 |
9 | 433124083213814 |
10 | 100020000210223 |
11 | 2996227566a135 |
12 | b274667846127 |
13 | 43a6acb895472 |
14 | 1a9adcb150579 |
15 | b86b3a57cc9d |
hex | 5af7b8953d2f |
100020000210223 has 4 divisors (see below), whose sum is σ = 100020231471880. Its totient is φ = 100019768948568.
The previous prime is 100020000210161. The next prime is 100020000210241. The reversal of 100020000210223 is 322012000020001.
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 100020000210223 - 229 = 100019463339311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100020000210293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114980865 + ... + 115847482.
It is an arithmetic number, because the mean of its divisors is an integer number (25005057867970).
Almost surely, 2100020000210223 is an apocalyptic number.
100020000210223 is a deficient number, since it is larger than the sum of its proper divisors (231261657).
100020000210223 is an equidigital number, since it uses as much as digits as its factorization.
100020000210223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231261656.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 100020000210223 its reverse (322012000020001), we get a palindrome (422032000230224).
The spelling of 100020000210223 in words is "one hundred trillion, twenty billion, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •