Base | Representation |
---|---|
bin | 100001000011111000101010… |
… | …010010111011011111001110 |
3 | 201001211100100111011112020111 |
4 | 201003320222102323133032 |
5 | 123024233341301202420 |
6 | 1233125000134510234 |
7 | 42424662205256224 |
oct | 4103705222733716 |
9 | 631740314145214 |
10 | 145402532444110 |
11 | 4236995aa23917 |
12 | 14383b99b0537a |
13 | 6319527991a26 |
14 | 27c973d2d0b14 |
15 | 11c23c0ae045a |
hex | 843e2a4bb7ce |
145402532444110 has 64 divisors (see below), whose sum is σ = 264040589030400. Its totient is φ = 57647743500672.
The previous prime is 145402532444093. The next prime is 145402532444129. The reversal of 145402532444110 is 11444235204541.
It is a super-2 number, since 2×1454025324441102 (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 31 ways as a sum of consecutive naturals, for example, 9168447361 + ... + 9168463219.
It is an arithmetic number, because the mean of its divisors is an integer number (4125634203600).
Almost surely, 2145402532444110 is an apocalyptic number.
145402532444110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145402532444110 is a deficient number, since it is larger than the sum of its proper divisors (118638056586290).
145402532444110 is a wasteful number, since it uses less digits than its factorization.
145402532444110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26425.
The product of its (nonzero) digits is 307200, while the sum is 40.
Adding to 145402532444110 its reverse (11444235204541), we get a palindrome (156846767648651).
The spelling of 145402532444110 in words is "one hundred forty-five trillion, four hundred two billion, five hundred thirty-two million, four hundred forty-four thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •