Base | Representation |
---|---|
bin | 100001000010110110110001… |
… | …010011010110111101001110 |
3 | 201001120120201211200020201202 |
4 | 201002312301103112331032 |
5 | 123022103442424134000 |
6 | 1233032255513305502 |
7 | 42416606031236402 |
oct | 4102666123267516 |
9 | 631516654606652 |
10 | 145331783036750 |
11 | 42341954806a22 |
12 | 14372334105292 |
13 | 63129611c958b |
14 | 27c614ad5d102 |
15 | 11c062e7ecdd5 |
hex | 842db14d6f4e |
145331783036750 has 32 divisors (see below), whose sum is σ = 275504909247360. Its totient is φ = 57396856077600.
The previous prime is 145331783036749. The next prime is 145331783036771. The reversal of 145331783036750 is 57630387133541.
It is a happy number.
145331783036750 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1453317830367502 (a number of 29 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, 3679265897 + ... + 3679305396.
It is an arithmetic number, because the mean of its divisors is an integer number (8609528413980).
Almost surely, 2145331783036750 is an apocalyptic number.
145331783036750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145331783036750 is a deficient number, since it is larger than the sum of its proper divisors (130173126210610).
145331783036750 is an equidigital number, since it uses as much as digits as its factorization.
145331783036750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7358571389 (or 7358571379 counting only the distinct ones).
The product of its (nonzero) digits is 19051200, while the sum is 56.
The spelling of 145331783036750 in words is "one hundred forty-five trillion, three hundred thirty-one billion, seven hundred eighty-three million, thirty-six thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •