Base | Representation |
---|---|
bin | 1001001001010111111100… |
… | …00111010100011001100110 |
3 | 2122012210221110210120212001 |
4 | 10210223332013110121212 |
5 | 10114014014323230202 |
6 | 110435531134515514 |
7 | 4144065220644424 |
oct | 444537607243146 |
9 | 78183843716761 |
10 | 20113300211302 |
11 | 6455003686801 |
12 | 230a113665b9a |
13 | b2b8a343819c |
14 | 4d76bb874114 |
15 | 24d2d6a73d87 |
hex | 124afe1d4666 |
20113300211302 has 4 divisors (see below), whose sum is σ = 30169950316956. Its totient is φ = 10056650105650.
The previous prime is 20113300211293. The next prime is 20113300211363. The reversal of 20113300211302 is 20311200331102.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×201133002113022 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20113300211302.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5028325052824 + ... + 5028325052827.
It is an arithmetic number, because the mean of its divisors is an integer number (7542487579239).
Almost surely, 220113300211302 is an apocalyptic number.
20113300211302 is a deficient number, since it is larger than the sum of its proper divisors (10056650105654).
20113300211302 is a wasteful number, since it uses less digits than its factorization.
20113300211302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10056650105653.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20113300211302 its reverse (20311200331102), we get a palindrome (40424500542404).
The spelling of 20113300211302 in words is "twenty trillion, one hundred thirteen billion, three hundred million, two hundred eleven thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •