Base | Representation |
---|---|
bin | 11100010011110100… |
… | …011101101110000110 |
3 | 2220110102212101201100 |
4 | 130103310131232012 |
5 | 444223201311043 |
6 | 21544143240530 |
7 | 2124162466545 |
oct | 342364355606 |
9 | 86412771640 |
10 | 30397291398 |
11 | 11989529a31 |
12 | 5a83ba9146 |
13 | 2b35798876 |
14 | 168510615c |
15 | bcd954cd3 |
hex | 713d1db86 |
30397291398 has 48 divisors (see below), whose sum is σ = 71717770800. Its totient is φ = 9268136640.
The previous prime is 30397291387. The next prime is 30397291409. The reversal of 30397291398 is 89319279303.
It is an interprime number because it is at equal distance from previous prime (30397291387) and next prime (30397291409).
It is a hoax number, since the sum of its digits (54) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1522513 + ... + 1542348.
It is an arithmetic number, because the mean of its divisors is an integer number (1494120225).
Almost surely, 230397291398 is an apocalyptic number.
30397291398 is a gapful number since it is divisible by the number (38) formed by its first and last digit.
30397291398 is an abundant number, since it is smaller than the sum of its proper divisors (41320479402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30397291398 is a wasteful number, since it uses less digits than its factorization.
30397291398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3064917 (or 3064914 counting only the distinct ones).
The product of its (nonzero) digits is 2204496, while the sum is 54.
The spelling of 30397291398 in words is "thirty billion, three hundred ninety-seven million, two hundred ninety-one thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •