Base | Representation |
---|---|
bin | 101101101100111110111011… |
… | …101010101010110100011010 |
3 | 222100200201201011212220021010 |
4 | 231230332323222222310122 |
5 | 202321214301142312310 |
6 | 1551255352443354350 |
7 | 60224003503223361 |
oct | 5554767352526432 |
9 | 870621634786233 |
10 | 201003323010330 |
11 | 5905603776a075 |
12 | 1a66395a2229b6 |
13 | 88206bbb35409 |
14 | 378c8815167d8 |
15 | 1838857401320 |
hex | b6cfbbaaad1a |
201003323010330 has 64 divisors (see below), whose sum is σ = 487204838277120. Its totient is φ = 53069634644544.
The previous prime is 201003323010317. The next prime is 201003323010377. The reversal of 201003323010330 is 33010323300102.
It is a super-2 number, since 2×2010033230103302 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201003323010297 and 201003323010306.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 52309600 + ... + 56020539.
It is an arithmetic number, because the mean of its divisors is an integer number (7612575598080).
Almost surely, 2201003323010330 is an apocalyptic number.
201003323010330 is an abundant number, since it is smaller than the sum of its proper divisors (286201515266790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201003323010330 is a wasteful number, since it uses less digits than its factorization.
201003323010330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108330763.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 201003323010330 its reverse (33010323300102), we get a palindrome (234013646310432).
The spelling of 201003323010330 in words is "two hundred one trillion, three billion, three hundred twenty-three million, ten thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •