Base | Representation |
---|---|
bin | 101110101101110011… |
… | …0010100110111111001 |
3 | 100120221112200220212102 |
4 | 1131123212110313321 |
5 | 3120424140141213 |
6 | 114030431353145 |
7 | 10151022420023 |
oct | 1353346246771 |
9 | 316845626772 |
10 | 100321021433 |
11 | 39600668276 |
12 | 175393827b5 |
13 | 95ca18a859 |
14 | 4bd9947013 |
15 | 29224ec158 |
hex | 175b994df9 |
100321021433 has 8 divisors (see below), whose sum is σ = 102611604168. Its totient is φ = 98045169664.
The previous prime is 100321021417. The next prime is 100321021453. The reversal of 100321021433 is 334120123001.
It can be written as a sum of positive squares in 4 ways, for example, as 36293298064 + 64027723369 = 190508^2 + 253037^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100321021433 - 24 = 100321021417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100321021453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3668966 + ... + 3696207.
It is an arithmetic number, because the mean of its divisors is an integer number (12826450521).
Almost surely, 2100321021433 is an apocalyptic number.
It is an amenable number.
100321021433 is a deficient number, since it is larger than the sum of its proper divisors (2290582735).
100321021433 is an equidigital number, since it uses as much as digits as its factorization.
100321021433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7365483.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 100321021433 its reverse (334120123001), we get a palindrome (434441144434).
The spelling of 100321021433 in words is "one hundred billion, three hundred twenty-one million, twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •