Base | Representation |
---|---|
bin | 101101101100111100110111… |
… | …010010111111001110111010 |
3 | 222100200111222102001112220020 |
4 | 231230330313102333032322 |
5 | 202321200224131204403 |
6 | 1551254344232111310 |
7 | 60223564455562650 |
oct | 5554746722771672 |
9 | 870614872045806 |
10 | 201001102209978 |
11 | 590550a8122984 |
12 | 1a66343a535536 |
13 | 8820426a00275 |
14 | 378c7105c2dd0 |
15 | 1838777476453 |
hex | b6cf374bf3ba |
201001102209978 has 128 divisors (see below), whose sum is σ = 468785379225600. Its totient is φ = 56266202247168.
The previous prime is 201001102209961. The next prime is 201001102209989. The reversal of 201001102209978 is 879902201100102.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4429558426 + ... + 4429603802.
It is an arithmetic number, because the mean of its divisors is an integer number (3662385775200).
Almost surely, 2201001102209978 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201001102209978, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234392689612800).
201001102209978 is an abundant number, since it is smaller than the sum of its proper divisors (267784277015622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201001102209978 is a wasteful number, since it uses less digits than its factorization.
201001102209978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51404.
The product of its (nonzero) digits is 36288, while the sum is 42.
The spelling of 201001102209978 in words is "two hundred one trillion, one billion, one hundred two million, two hundred nine thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •