Base | Representation |
---|---|
bin | 10110111111010111001010… |
… | …010110100000000000001100 |
3 | 111021000010201202210220122011 |
4 | 112333113022112200000030 |
5 | 101223101234310323040 |
6 | 555013504144031004 |
7 | 30204021201323212 |
oct | 2677271226400014 |
9 | 437003652726564 |
10 | 101111220011020 |
11 | 2a24303380654a |
12 | b410047002464 |
13 | 44559935bb29b |
14 | 1ad7b4849acb2 |
15 | ba52052bd3ea |
hex | 5bf5ca5a000c |
101111220011020 has 48 divisors (see below), whose sum is σ = 219184125124608. Its totient is φ = 39139631858880.
The previous prime is 101111220011003. The next prime is 101111220011023. The reversal of 101111220011020 is 20110022111101.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (101111220011023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 221796157 + ... + 222251563.
It is an arithmetic number, because the mean of its divisors is an integer number (4566335940096).
Almost surely, 2101111220011020 is an apocalyptic number.
101111220011020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101111220011020 is an abundant number, since it is smaller than the sum of its proper divisors (118072905113588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111220011020 is a wasteful number, since it uses less digits than its factorization.
101111220011020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813550 (or 813548 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101111220011020 its reverse (20110022111101), we get a palindrome (121221242122121).
The spelling of 101111220011020 in words is "one hundred one trillion, one hundred eleven billion, two hundred twenty million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •