Base | Representation |
---|---|
bin | 101101101101010000100110… |
… | …110111000111011001110001 |
3 | 222100202112200210220010111201 |
4 | 231231100212313013121301 |
5 | 202322022133113220213 |
6 | 1551312211554211201 |
7 | 60225245011114030 |
oct | 5555204667073161 |
9 | 870675623803451 |
10 | 201022301304433 |
11 | 5906309649a354 |
12 | 1a667575b83b01 |
13 | 882242494313b |
14 | 378d761c40717 |
15 | 18390b85ee6dd |
hex | b6d426dc7671 |
201022301304433 has 8 divisors (see below), whose sum is σ = 230464504066752. Its totient is φ = 171761281328976.
The previous prime is 201022301304431. The next prime is 201022301304469. The reversal of 201022301304433 is 334403103220102.
It is a happy number.
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 201022301304433 - 21 = 201022301304431 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201022301304431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45295694335 + ... + 45295698772.
It is an arithmetic number, because the mean of its divisors is an integer number (28808063008344).
Almost surely, 2201022301304433 is an apocalyptic number.
It is an amenable number.
201022301304433 is a deficient number, since it is larger than the sum of its proper divisors (29442202762319).
201022301304433 is an equidigital number, since it uses as much as digits as its factorization.
201022301304433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90591393431.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 201022301304433 its reverse (334403103220102), we get a palindrome (535425404524535).
The spelling of 201022301304433 in words is "two hundred one trillion, twenty-two billion, three hundred one million, three hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •