Base | Representation |
---|---|
bin | 1000011101100011101… |
… | …0111011010011101100 |
3 | 111220020022102002112020 |
4 | 2013120322323103230 |
5 | 4340211022343300 |
6 | 150441125110140 |
7 | 13334325131403 |
oct | 2073072732354 |
9 | 456208362466 |
10 | 145373246700 |
11 | 5671a4539a0 |
12 | 24211258350 |
13 | 10929b55c06 |
14 | 70710cc63a |
15 | 3bac8048a0 |
hex | 21d8ebb4ec |
145373246700 has 144 divisors (see below), whose sum is σ = 464380027776. Its totient is φ = 34817331200.
The previous prime is 145373246687. The next prime is 145373246743. The reversal of 145373246700 is 7642373541.
It is a super-2 number, since 2×1453732467002 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8524 + ... + 539276.
It is an arithmetic number, because the mean of its divisors is an integer number (3224861304).
Almost surely, 2145373246700 is an apocalyptic number.
145373246700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145373246700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (232190013888).
145373246700 is an abundant number, since it is smaller than the sum of its proper divisors (319006781076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145373246700 is a wasteful number, since it uses less digits than its factorization.
145373246700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530864 (or 530857 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 42.
The spelling of 145373246700 in words is "one hundred forty-five billion, three hundred seventy-three million, two hundred forty-six thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •