Base | Representation |
---|---|
bin | 10111000010011010101111… |
… | …010101010011111010000010 |
3 | 111021202012210001001100210000 |
4 | 113002122233111103322002 |
5 | 101240021324322041002 |
6 | 555254154223020430 |
7 | 30225134200612452 |
oct | 2702325725237202 |
9 | 437665701040700 |
10 | 101321220112002 |
11 | 2a3140a7350610 |
12 | b44489373a716 |
13 | 446c71c631877 |
14 | 1b03d8a729d62 |
15 | baa8e662061c |
hex | 5c26af553e82 |
101321220112002 has 80 divisors (see below), whose sum is σ = 247969298808000. Its totient is φ = 30666804348960.
The previous prime is 101321220111989. The next prime is 101321220112003. The reversal of 101321220112002 is 200211022123101.
101321220112002 is a `hidden beast` number, since 1 + 0 + 1 + 321 + 220 + 1 + 120 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (101321220112003) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 32389377 + ... + 35379572.
It is an arithmetic number, because the mean of its divisors is an integer number (3099616235100).
Almost surely, 2101321220112002 is an apocalyptic number.
101321220112002 is an abundant number, since it is smaller than the sum of its proper divisors (146648078695998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101321220112002 is a wasteful number, since it uses less digits than its factorization.
101321220112002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67769813 (or 67769804 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 101321220112002 its reverse (200211022123101), we get a palindrome (301532242235103).
The spelling of 101321220112002 in words is "one hundred one trillion, three hundred twenty-one billion, two hundred twenty million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •