Base | Representation |
---|---|
bin | 1000111010110100000… |
… | …10101100100001010000 |
3 | 1002022000021000100220001 |
4 | 10131122002230201100 |
5 | 20010104023142341 |
6 | 352441022255344 |
7 | 31066125234430 |
oct | 4353202544120 |
9 | 1068007010801 |
10 | 306453334096 |
11 | 108a69a10768 |
12 | 4b486727554 |
13 | 22b8aac0ab0 |
14 | 10b9223a2c0 |
15 | 7e88ee2d31 |
hex | 475a0ac850 |
306453334096 has 80 divisors (see below), whose sum is σ = 731019184000. Its totient is φ = 121193501184.
The previous prime is 306453334079. The next prime is 306453334111. The reversal of 306453334096 is 690433354603.
It is a super-2 number, since 2×3064533340962 (a number of 24 digits) contains 22 as substring.
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, 4492855 + ... + 4560553.
It is an arithmetic number, because the mean of its divisors is an integer number (9137739800).
Almost surely, 2306453334096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 306453334096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (365509592000).
306453334096 is an abundant number, since it is smaller than the sum of its proper divisors (424565849904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
306453334096 is a wasteful number, since it uses less digits than its factorization.
306453334096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70836 (or 70830 counting only the distinct ones).
The product of its (nonzero) digits is 2099520, while the sum is 46.
Adding to 306453334096 its reverse (690433354603), we get a palindrome (996886688699).
The spelling of 306453334096 in words is "three hundred six billion, four hundred fifty-three million, three hundred thirty-four thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •