Base | Representation |
---|---|
bin | 1000100001100101001110… |
… | …0001111000000100010001 |
3 | 1020012001101212210200012102 |
4 | 2020121103201320010101 |
5 | 2212031421111413301 |
6 | 31533523404210145 |
7 | 1655115113463263 |
oct | 210312341700421 |
9 | 36161355720172 |
10 | 9373020029201 |
11 | 2a940914a80a4 |
12 | 1074679539955 |
13 | 52cb44a10c6a |
14 | 24592997bb33 |
15 | 113c31699b6b |
hex | 88653878111 |
9373020029201 has 4 divisors (see below), whose sum is σ = 9407863970100. Its totient is φ = 9338176088304.
The previous prime is 9373020029159. The next prime is 9373020029209. The reversal of 9373020029201 is 1029200203739.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2609904870400 + 6763115158801 = 1615520^2 + 2600599^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9373020029201 is a prime.
It is a super-2 number, since 2×93730200292012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9373020029209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17421970046 + ... + 17421970583.
It is an arithmetic number, because the mean of its divisors is an integer number (2351965992525).
Almost surely, 29373020029201 is an apocalyptic number.
It is an amenable number.
9373020029201 is a deficient number, since it is larger than the sum of its proper divisors (34843940899).
9373020029201 is a wasteful number, since it uses less digits than its factorization.
9373020029201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34843940898.
The product of its (nonzero) digits is 40824, while the sum is 38.
The spelling of 9373020029201 in words is "nine trillion, three hundred seventy-three billion, twenty million, twenty-nine thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •