Base | Representation |
---|---|
bin | 110100110111100001101000… |
… | …111111101010110101001100 |
3 | 1010111021010120011211100201022 |
4 | 310313201220333222311030 |
5 | 220434002344412312403 |
6 | 2142303301421533312 |
7 | 66655406266264130 |
oct | 6467415077526514 |
9 | 1114233504740638 |
10 | 232514111057228 |
11 | 680a4754074850 |
12 | 220b2961414238 |
13 | 9c97ca9704760 |
14 | 415ba58bc93c0 |
15 | 1bd335b6e7d38 |
hex | d37868fead4c |
232514111057228 has 96 divisors (see below), whose sum is σ = 548712571330560. Its totient is φ = 83256298986240.
The previous prime is 232514111057227. The next prime is 232514111057257. The reversal of 232514111057228 is 822750111415232.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is not an unprimeable number, because it can be changed into a prime (232514111057227) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 125874476 + ... + 127708307.
It is an arithmetic number, because the mean of its divisors is an integer number (5715755951360).
Almost surely, 2232514111057228 is an apocalyptic number.
232514111057228 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
232514111057228 is an abundant number, since it is smaller than the sum of its proper divisors (316198460273332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232514111057228 is a wasteful number, since it uses less digits than its factorization.
232514111057228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253583047 (or 253583045 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 44.
The spelling of 232514111057228 in words is "two hundred thirty-two trillion, five hundred fourteen billion, one hundred eleven million, fifty-seven thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •