Base | Representation |
---|---|
bin | 100010010101011011110001… |
… | …0010111010011011000000000 |
3 | 1110121100011101011021001000011 |
4 | 1010222313202113103120000 |
5 | 304041140122324043240 |
6 | 2550154510213234304 |
7 | 120420502002554116 |
oct | 10452674227233000 |
9 | 1417304334231004 |
10 | 302013013112320 |
11 | 88259aaa491194 |
12 | 29a5818b032994 |
13 | cc6992197c243 |
14 | 54817176a5ab6 |
15 | 24db0b8ecd6ea |
hex | 112ade25d3600 |
302013013112320 has 80 divisors (see below), whose sum is σ = 741784934788128. Its totient is φ = 117858736783360.
The previous prime is 302013013112309. The next prime is 302013013112329. The reversal of 302013013112320 is 23211310310203.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 302013013112291 and 302013013112300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302013013112329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1438600324 + ... + 1438810243.
Almost surely, 2302013013112320 is an apocalyptic number.
It is an amenable number.
302013013112320 is an abundant number, since it is smaller than the sum of its proper divisors (439771921675808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302013013112320 is an equidigital number, since it uses as much as digits as its factorization.
302013013112320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2877410631 (or 2877410615 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 302013013112320 its reverse (23211310310203), we get a palindrome (325224323422523).
The spelling of 302013013112320 in words is "three hundred two trillion, thirteen billion, thirteen million, one hundred twelve thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •