Base | Representation |
---|---|
bin | 1001010100000110101… |
… | …01110000110101000110 |
3 | 1010121001111222100111020 |
4 | 10222003111300311012 |
5 | 20220410430201410 |
6 | 403004213052010 |
7 | 32056445316432 |
oct | 4520325606506 |
9 | 1117044870436 |
10 | 320031100230 |
11 | 1137a7238396 |
12 | 52035927006 |
13 | 24242aa523a |
14 | 116bd6019c2 |
15 | 84d101ea70 |
hex | 4a83570d46 |
320031100230 has 64 divisors (see below), whose sum is σ = 770851219968. Its totient is φ = 85033428480.
The previous prime is 320031100189. The next prime is 320031100241. The reversal of 320031100230 is 32001130023.
It is a super-2 number, since 2×3200311002302 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18590287 + ... + 18607493.
It is an arithmetic number, because the mean of its divisors is an integer number (12044550312).
Almost surely, 2320031100230 is an apocalyptic number.
320031100230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
320031100230 is an abundant number, since it is smaller than the sum of its proper divisors (450820119738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
320031100230 is a wasteful number, since it uses less digits than its factorization.
320031100230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19421.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 320031100230 its reverse (32001130023), we get a palindrome (352032230253).
The spelling of 320031100230 in words is "three hundred twenty billion, thirty-one million, one hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •