Base | Representation |
---|---|
bin | 1000111101101110000… |
… | …11101001111100000000 |
3 | 1002110001000102122020211 |
4 | 10132313003221330000 |
5 | 20021303022214002 |
6 | 353255530043504 |
7 | 31152604445344 |
oct | 4366703517400 |
9 | 1073030378224 |
10 | 308013866752 |
11 | 10969a885a79 |
12 | 4b841279594 |
13 | 230791b85b7 |
14 | 10c9d5b9624 |
15 | 802aee7dd7 |
hex | 47b70e9f00 |
308013866752 has 36 divisors (see below), whose sum is σ = 617216999616. Its totient is φ = 153407651840.
The previous prime is 308013866747. The next prime is 308013866789. The reversal of 308013866752 is 257668310803.
It is a super-2 number, since 2×3080138667522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 308013866696 and 308013866705.
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 3 ways as a sum of consecutive naturals, for example, 2275024 + ... + 2406607.
It is an arithmetic number, because the mean of its divisors is an integer number (17144916656).
Almost surely, 2308013866752 is an apocalyptic number.
308013866752 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
308013866752 is an abundant number, since it is smaller than the sum of its proper divisors (309203132864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
308013866752 is an equidigital number, since it uses as much as digits as its factorization.
308013866752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4681904 (or 4681890 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 308013866752 in words is "three hundred eight billion, thirteen million, eight hundred sixty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •