Base | Representation |
---|---|
bin | 10111000010011001101101… |
… | …111100111011101011111100 |
3 | 111021202002221121000120112202 |
4 | 113002121231330323223330 |
5 | 101240012103014433200 |
6 | 555253453320251032 |
7 | 30225065051210132 |
oct | 2702315574735374 |
9 | 437662847016482 |
10 | 101320123202300 |
11 | 2a313694157072 |
12 | b444628310a78 |
13 | 446c5a62c3682 |
14 | 1b03cc4b93752 |
15 | baa88019a1d5 |
hex | 5c266df3bafc |
101320123202300 has 36 divisors (see below), whose sum is σ = 221881774412760. Its totient is φ = 40156232310720.
The previous prime is 101320123202279. The next prime is 101320123202317. The reversal of 101320123202300 is 3202321023101.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 4647701174 + ... + 4647722973.
Almost surely, 2101320123202300 is an apocalyptic number.
101320123202300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101320123202300 is an abundant number, since it is smaller than the sum of its proper divisors (120561651210460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101320123202300 is a wasteful number, since it uses less digits than its factorization.
101320123202300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9295424270 (or 9295424263 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 101320123202300 its reverse (3202321023101), we get a palindrome (104522444225401).
The spelling of 101320123202300 in words is "one hundred one trillion, three hundred twenty billion, one hundred twenty-three million, two hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •