Base | Representation |
---|---|
bin | 1101111011001010011001… |
… | …00011001110000101100110 |
3 | 11000102020211211211021121101 |
4 | 12331211030203032011212 |
5 | 13003134434133414332 |
6 | 145042403234110314 |
7 | 6310141526625055 |
oct | 675451443160546 |
9 | 130366754737541 |
10 | 30620106154342 |
11 | 9835a06728a31 |
12 | 352646b71b39a |
13 | 14116047611b3 |
14 | 77c041a6a39c |
15 | 381774d80ae7 |
hex | 1bd94c8ce166 |
30620106154342 has 8 divisors (see below), whose sum is σ = 45942509379600. Its totient is φ = 15305936361144.
The previous prime is 30620106154301. The next prime is 30620106154349. The reversal of 30620106154342 is 24345160102603.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×306201061543423 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30620106154349) by changing a digit.
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 in 3 ways as a sum of consecutive naturals, for example, 2058348717 + ... + 2058363592.
It is an arithmetic number, because the mean of its divisors is an integer number (5742813672450).
Almost surely, 230620106154342 is an apocalyptic number.
30620106154342 is a deficient number, since it is larger than the sum of its proper divisors (15322403225258).
30620106154342 is a wasteful number, since it uses less digits than its factorization.
30620106154342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4116716030.
The product of its (nonzero) digits is 103680, while the sum is 37.
Adding to 30620106154342 its reverse (24345160102603), we get a palindrome (54965266256945).
The spelling of 30620106154342 in words is "thirty trillion, six hundred twenty billion, one hundred six million, one hundred fifty-four thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •