Base | Representation |
---|---|
bin | 1000110010110000101… |
… | …10110111110000111110 |
3 | 1001212211222002101102020 |
4 | 10121120112313300332 |
5 | 14422230301220220 |
6 | 350444024341010 |
7 | 30554031326262 |
oct | 4313026676076 |
9 | 1055758071366 |
10 | 302130101310 |
11 | 107150624a04 |
12 | 4a67a914766 |
13 | 2264c22889b |
14 | 108a1dc60a2 |
15 | 7cd46c0040 |
hex | 46585b7c3e |
302130101310 has 32 divisors (see below), whose sum is σ = 725217121152. Its totient is φ = 80556373920.
The previous prime is 302130101309. The next prime is 302130101321. The reversal of 302130101310 is 13101031203.
It is a super-2 number, since 2×3021301013102 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 302130101310.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 516436 + ... + 933255.
It is an arithmetic number, because the mean of its divisors is an integer number (22663035036).
Almost surely, 2302130101310 is an apocalyptic number.
302130101310 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
302130101310 is an abundant number, since it is smaller than the sum of its proper divisors (423087019842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302130101310 is a wasteful number, since it uses less digits than its factorization.
302130101310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1456648.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 302130101310 its reverse (13101031203), we get a palindrome (315231132513).
The spelling of 302130101310 in words is "three hundred two billion, one hundred thirty million, one hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •