Base | Representation |
---|---|
bin | 110000001000001000101001… |
… | …0110000110110010011100000 |
3 | 2001111220000010112220202222210 |
4 | 1200100101102300312103200 |
5 | 420441321424021200000 |
6 | 4100203211225202120 |
7 | 155111423355135456 |
oct | 14020212260662340 |
9 | 2044800115822883 |
10 | 423330545100000 |
11 | 1129825265603aa |
12 | 3b590367030340 |
13 | 15229b8c46b445 |
14 | 76774444c09d6 |
15 | 33e1beb7b7350 |
hex | 1810452c364e0 |
423330545100000 has 144 divisors (see below), whose sum is σ = 1388964452679216. Its totient is φ = 112888145280000.
The previous prime is 423330545099951. The next prime is 423330545100011. The reversal of 423330545100000 is 1545033324.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 23 ways as a sum of consecutive naturals, for example, 705250909 + ... + 705850908.
It is an arithmetic number, because the mean of its divisors is an integer number (9645586476939).
Almost surely, 2423330545100000 is an apocalyptic number.
423330545100000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
423330545100000 is an abundant number, since it is smaller than the sum of its proper divisors (965633907579216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423330545100000 is an equidigital number, since it uses as much as digits as its factorization.
423330545100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411101855 (or 1411101827 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
The spelling of 423330545100000 in words is "four hundred twenty-three trillion, three hundred thirty billion, five hundred forty-five million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •