Base | Representation |
---|---|
bin | 1000110100101000000… |
… | …01111000001100111000 |
3 | 1001222102201220001012211 |
4 | 10122110001320030320 |
5 | 14431303043343112 |
6 | 351131230144504 |
7 | 30620605643650 |
oct | 4322401701470 |
9 | 1058381801184 |
10 | 303131231032 |
11 | 10761474a543 |
12 | 4a8ba052134 |
13 | 2277b770036 |
14 | 10958d49360 |
15 | 7d425260a7 |
hex | 4694078338 |
303131231032 has 64 divisors (see below), whose sum is σ = 658507838400. Its totient is φ = 128132505600.
The previous prime is 303131231021. The next prime is 303131231057. The reversal of 303131231032 is 230132131303.
It is a junction number, because it is equal to n+sod(n) for n = 303131230994 and 303131231012.
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, 1922748 + ... + 2074420.
It is an arithmetic number, because the mean of its divisors is an integer number (10289184975).
Almost surely, 2303131231032 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 303131231032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (329253919200).
303131231032 is an abundant number, since it is smaller than the sum of its proper divisors (355376607368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
303131231032 is a wasteful number, since it uses less digits than its factorization.
303131231032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152176 (or 152172 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 303131231032 its reverse (230132131303), we get a palindrome (533263362335).
The spelling of 303131231032 in words is "three hundred three billion, one hundred thirty-one million, two hundred thirty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •